A simple formalization of actions using circumscription

Authors:
G. Neelakantan Kartha;Vladimir Lifschitz
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Texas;Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Venue:
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Year:
1995

Citing 6
Cited 8

Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Nonmonotonic logic and temporal projection

Artificial Intelligence
Nonmonotonic reasoning in the framework of situation calculus

Artificial Intelligence - Special issue on knowledge representation
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Nested abnormality theories

Artificial Intelligence
Temporal reasoning in the situation calculus

Temporal reasoning in the situation calculus

Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
Some Alternative Formulations of the Event Calculus

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Explaining Updates by Minimal Sums

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Change, change, change: three approaches

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A circumscriptive formalization of the qualification problem

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
The event calculus explained

Artificial intelligence today
Beyond minimizing change

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Lifschitz and circumscription

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple circumscriptive method for formalizing actions with indirect effects (ramifications), and show that, in several examples, all second-order quantifiers can be eliminated from these formalizations using existing techniques for computing circumscriptions. One of the two symbolic computation methods employed here is a generalization of predicate completion and the other is based on the SCAN algorithm. The simplicity of our new approach to representing actions is due to the use of the formalism of nested abnormality theories.