Loop formulas for circumscription

Joohyung Lee, Fangzhen Lin

Research output: Contribution to journalArticle

15 Citations (Scopus)

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".

Original languageEnglish (US)
Pages (from-to)160-185
Number of pages26
JournalArtificial Intelligence
Volume170
Issue number2
DOIs
StatePublished - Feb 2006

Fingerprint

logic
Semantics
semantics
Completion
Logic
Nonmonotonic Logic
Causal

Keywords

  • Circumscription
  • Clark's completion
  • Commonsense reasoning
  • Knowledge representation
  • Logic programming
  • Loop formulas
  • Nonmonotonic reasoning

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

Cite this

Loop formulas for circumscription. / Lee, Joohyung; Lin, Fangzhen.

In: Artificial Intelligence, Vol. 170, No. 2, 02.2006, p. 160-185.

Research output: Contribution to journalArticle

Lee, Joohyung ; Lin, Fangzhen. / Loop formulas for circumscription. In: Artificial Intelligence. 2006 ; Vol. 170, No. 2. pp. 160-185.
@article{8f632e6bb36743598c894a17b09a106f,
title = "Loop formulas for circumscription",
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{"}.",
keywords = "Circumscription, Clark's completion, Commonsense reasoning, Knowledge representation, Logic programming, Loop formulas, Nonmonotonic reasoning",
author = "Joohyung Lee and Fangzhen Lin",
year = "2006",
month = "2",
doi = "10.1016/j.artint.2005.09.003",
language = "English (US)",
volume = "170",
pages = "160--185",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Loop formulas for circumscription

AU - Lee, Joohyung

AU - Lin, Fangzhen

PY - 2006/2

Y1 - 2006/2

N2 - 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".

AB - 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".

KW - Circumscription

KW - Clark's completion

KW - Commonsense reasoning

KW - Knowledge representation

KW - Logic programming

KW - Loop formulas

KW - Nonmonotonic reasoning

UR - http://www.scopus.com/inward/record.url?scp=29344460362&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=29344460362&partnerID=8YFLogxK

U2 - 10.1016/j.artint.2005.09.003

DO - 10.1016/j.artint.2005.09.003

M3 - Article

AN - SCOPUS:29344460362

VL - 170

SP - 160

EP - 185

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

IS - 2

ER -