Loop formulas for circumscription

Authors:
Joohyung Lee;Fangzhen Lin
Affiliations:
Department of Computer Science and Engineering, Arizona State University, AZ;Department of Computer Science, Hong Kong University of Science and Technology, Kowloon, Hong Kong
Venue:
Artificial Intelligence
Year:
2006

Citing 21
Cited 1

Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Pointwise circumscription

Readings in nonmonotonic reasoning
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
On the logic of causal explanation

Artificial Intelligence
Foundations of logic programming

Principles of knowledge representation
On strongest neccessary and weakest sufficient conditions

Artificial Intelligence
Getting to the airport: the oldest planning problem in AI

Logic-based artificial intelligence
Formalizing Commonsense: Papers by John McCarthy

Formalizing Commonsense: Papers by John McCarthy
Nested expressions in logic programs

Annals of Mathematics and Artificial Intelligence
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
ASSAT: computing answer sets of a logic program by SAT solvers

Eighteenth national conference on Artificial intelligence
Tight logic programs

Theory and Practice of Logic Programming
Nonmonotonic causal theories

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
An executable specification of an argumentation protocol

ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
Why are there so many loop formulas?

ACM Transactions on Computational Logic (TOCL)
SAT-based answer set programming

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Compiling causal theories to successor state axioms and STRIPS-like systems

Journal of Artificial Intelligence Research
A model-theoretic counterpart of loop formulas

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Specifying electronic societies with the causal calculator

AOSE'02 Proceedings of the 3rd international conference on Agent-oriented software engineering III
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

A new perspective on stable models

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop formulas" so that general cases of nonmonotonic logics such as logic programs (under the answer set semantics) and McCain-Turner causal logic can be characterized by propositional logic in the form of "completion + loop formulas". In this paper, we show that the idea is applicable to McCarthy's circumscription in the propositional case, with Lifschitz's pointwise circumscription playing the role of completion. We also show how to embed propositional circumscription in logic programs and in causal logic, inspired by the uniform characterization of "completion + loop formulas".