Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Reasoning about action I: a possible worlds approach
Artificial Intelligence
On the logic of iterated belief revision
Artificial Intelligence
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A computational approach for belief change
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
| Hi-index | 0.00 |
In this paper, we present a programmable method of revising a finite clause set. We first present a procedure whose formal parameters are a consistent clause set Γ and a clause A and whose output is a set of minimal subsets of Γ which are inconsistent with A. The maximal consistent subsets can be generated from all minimal inconsistent subsets. We develop a prototype system based on the above procedure, and discuss the implementation of knowledge base maintenance. At last, we compare the approach presented in this paper with other related approaches. The main characteristic of the approach is that it can be implemented by a computer program.