Language features for flexible handling of exceptions in information systems
ACM Transactions on Database Systems (TODS)
Updating logical databases
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
On the semantics of theory change: arbitration between old and new information
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
The size of a revised knowledge base
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Propositional belief base update and minimal change
Artificial Intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
On strongest neccessary and weakest sufficient conditions
Artificial Intelligence
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A consistency-based approach for belief change
Artificial Intelligence
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
The strategy-proofness landscape of merging
Journal of Artificial Intelligence Research
Quota and Gmin merging operators
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Forgetting and knowledge update
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
From inconsistency to consistency: knowledge base revision by tableaux opening
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update sentence's structure, and that may be reasonably implemented. In addressing update, we first provide a definition phrased in terms of the models of a knowledge base. While this operator satisfies a core group of the benchmark Katsuno-Mendelzon update postulates, not all of the postulates are satisfied. Other Katsuno-Mendelzon postulates can be obtained by suitably restricting the syntactic form of the sentence for update, as we show. In restricting the syntactic form of the sentence for update, we also obtain a hierarchy of update operators withWinslett's standard semantics as the most basic interesting approach captured. We subsequently give an algorithm which captures this approach; in the general case the algorithm is exponential, but with some not-unreasonable assumptions we obtain an algorithm that is linear in the size of the knowledge base. Hence the resulting approach has much better complexity characteristics than other operators in some situations. We also explore other compositional belief change operators: erasure is developed as a dual operator to update; we show that a forget operator is definable in terms of update; and we give a definition of the compositional revision operator. We obtain that compositional revision, under the most natural definition, yields the Satoh revision operator.