Updating logical databases
Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Artificial Intelligence
A unified model of qualitative belief change: a dynamical systems perspective
Artificial Intelligence
Two forms of dependence in propositional logic: controllability and definability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An action language based on causal explanation: preliminary report
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The size of a revised knowledge base
Artificial Intelligence
Propositional belief base update and minimal change
Artificial Intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
The complexity of belief update
Artificial Intelligence
Decomposable negation normal form
Journal of the ACM (JACM)
Conditional independence in propositional logic
Artificial Intelligence
AI '01 Proceedings of the 14th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
A Syntax-based Approach to Reasoning about Action and Belief Update
Journal of Logic and Computation
Prime Implicate-based Belief Revision Operators
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On the update of description logic ontologies at the instance level
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
First-order Generalization of the MPMA Belief Update Operator
Fundamenta Informaticae
Knowledge forgetting: Properties and applications
Artificial Intelligence
On the approximation of instance level update and erasure in description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Introducing actions into qualitative simulation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Causal theories of action: a computational core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Journal of Artificial Intelligence Research
Updates, actions, and planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Updating action domain descriptions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Knowledge updates: Semantics and complexity issues
Artificial Intelligence
Updating action domain descriptions
Artificial Intelligence
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Iterated belief change in the situation calculus
Artificial Intelligence
Artificial Intelligence
Belief extrapolation (or how to reason about observations and unpredicted change)
Artificial Intelligence
Iterated belief change due to actions and observations
Journal of Artificial Intelligence Research
Forgetting and knowledge update
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
The Compactness of Belief Revision and Update Operators
Fundamenta Informaticae
The PMA and Relativizing Minimal Change for Action Update
Fundamenta Informaticae
Hi-index | 0.00 |
We present and study a general family of belief update operators in a propositional setting. Its operators are based on formula/literal dependence, which is more fine-grained than the notion of formula/variable dependence that was proposed in the literature: formula/variable dependence is a particular case of formula/literal dependence. Our update operators are defined according to the “forget-then-conjoin” scheme: updating a belief base by an input formula consists in first forgetting in the base every literal on which the input formula has a negative influence, and then conjoining the resulting base with the input formula. The operators of our family differ by the underlying notion of formula/literal dependence, which may be defined syntactically or semantically, and which may or may not exploit further information like known persistent literals and pre-set dependencies. We argue that this allows to handle the frame problem and the ramification problem in a more appropriate way. We evaluate the update operators of our family w.r.t. two important dimensions: the logical dimension, by checking the status of the Katsuno-Mendelzon postulates for update, and the computational dimension, by identifying the complexity of a number of decision problems (including model checking, consistency and inference), both in the general case and in some restricted cases, as well as by studying compactability issues. It follows that several operators of our family are interesting alternatives to previous belief update operators.