On the satisfiability of circumscription

DOI10.1016/0004-3702(86)90028-7zbMath0589.03020OpenAlexW2076024411MaRDI QIDQ1073786

Vladimir Lifschitz

Publication date: 1986

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(86)90028-7

Mathematics Subject Classification ID

Artificial intelligence (68T99) Second- and higher-order model theory (03C85)

Related Items (24)

Automatically generating abstractions for planning ⋮ Deriving properties of belief update from theories of action ⋮ Negation as failure: careful closure procedure ⋮ Default reasoning by deductive planning ⋮ Exploiting the normative aspect of preference: A deontic logic without actions ⋮ Autocircumscription ⋮ Circumscriptive semantics for updating knowledge bases ⋮ The importance of open and recursive circumscription ⋮ ECWA made easy ⋮ An extension of pointwise circumscription ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Is there an alternative to parsimonious semantics? ⋮ A new deductive approach to planning ⋮ Between constructive mathematics and PROLOG ⋮ Nonmonotonic reasoning, preferential models and cumulative logics ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ Nonmonotonicity and the scope of reasoning ⋮ Abstract minimality and circumscription ⋮ Circumscription: Completeness reviewed ⋮ Annotation theories over finite graphs ⋮ A theorem on the consistency of circumscription ⋮ Using approximate reasoning to represent default knowledge ⋮ Decidability and definability with circumscription ⋮ Prioritized logic programming and its application to commonsense reasoning

Cites Work

• Saturation, nonmonotonic reasoning and the closed-world assumption
• Circumscription - a form of non-monotonic reasoning

This page was built for publication: On the satisfiability of circumscription