The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Updating logical databases
SIAM Journal on Computing
Handbook of theoretical computer science (vol. B)
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Knowledge-level analysis of belief base operations
Artificial Intelligence
A unified model of qualitative belief change: a dynamical systems perspective
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 complexity of belief update
Artificial Intelligence
Proceedings of the 1999 international conference on Logic programming
Default reasoning from conditional knowledge bases: complexity and tractable cases
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Nonmonotonic reasoning: from complexity to algorithms
Annals of Mathematics and Artificial Intelligence
Journal of Logic, Language and Information
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Consistency of Action Descriptions
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Revising Nonmonotonic Theories: The Case of Defeasible Logic
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Logics for Emerging Applications of Databases
Logics for Emerging Applications of Databases
On the revision of preferences and rational inference processes
Artificial Intelligence
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
Formalizing elaboration tolerance
Formalizing elaboration tolerance
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Representing the zoo world and the traffic world in the language of the causal calculator
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Comparing action descriptions based on semantic preferences
Annals of Mathematics and Artificial Intelligence
Resolving Conflicts in Action Descriptions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Elaborating domain descriptions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Merging Logic Programs under Answer Set Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Error classification in action descriptions: a heuristic approach
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Modeling belief in dynamic systems part II: revision and update
Journal of Artificial Intelligence Research
Minimal change and maximal coherence: a basis for belief revision and reasoning about actions
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Inconsistency management and prioritized syntax-based entailment
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Causal theories of action: a computational core
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Describing additive fluents in action language C+
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Updating action domain descriptions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Knowledge updates: Semantics and complexity issues
Artificial Intelligence
What is believed is what is explained (sometimes)
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A tool for answering queries on action descriptions
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
From logic programs updates to action description updates
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Applications of action languages in cognitive robotics
Correct Reasoning
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Incorporating new information into a knowledge base is an important problem which has been widely investigated. In this paper, we study this problem in a formal framework for reasoning about actions and change. In this framework, action domains are described in an action language whose semantics is based on the notion of causality. Unlike the formalisms considered in the related work, this language allows straightforward representation of non-deterministic effects and indirect effects of (possibly concurrent) actions, as well as state constraints; therefore, the updates can be more general than elementary statements. The expressivity of this formalism allows us to study the update of an action domain description with a more general approach compared to related work. First of all, we consider the update of an action description with respect to further criteria, for instance, by ensuring that the updated description entails some observations, assertions, or general domain properties that constitute further constraints that are not expressible in an action description in general. Moreover, our framework allows us to discriminate amongst alternative updates of action domain descriptions and to single out a most preferable one, based on a given preference relation possibly dependent on the specified criteria. We study semantic and computational aspects of the update problem, and establish basic properties of updates as well as a decomposition theorem that gives rise to a divide and conquer approach to updating action descriptions under certain conditions. Furthermore, we study the computational complexity of decision problems around computing solutions, both for the generic setting and for two particular preference relations, viz. set-inclusion and weight-based preference. While deciding the existence of solutions and recognizing solutions are PSPACE-complete problems in general, the problems fall back into the polynomial hierarchy under restrictions on the additional constraints. We finally discuss methods to compute solutions and approximate solutions (which disregard preference). Our results provide a semantic and computational basis for developing systems that incorporate new information into action domain descriptions in an action language, in the presence of additional constraints.