Loop formulas for circumscription

Joohyung Lee, Fangzhen Lin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Clark's completion is a simple nonmonotonic formalism and a special case of many 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. We also show how to embed propositional circumscription in logic programs and in causal logic, inspired by the uniform characterization of "completion + loop formulas".

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Pages281-286
Number of pages6
StatePublished - 2004
Externally publishedYes
EventProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004) - San Jose, CA, United States
Duration: Jul 25 2004Jul 29 2004

Other

OtherProceedings - Nineteenth National Conference on Artificial Intelligence (AAAI-2004): Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI-2004)
CountryUnited States
CitySan Jose, CA
Period7/25/047/29/04

ASJC Scopus subject areas

  • Software

Cite this