On the satisfiability of circumscription

DOI10.1016/0004-3702(86)90028-7MaRDI QIDQ1073786zbMATH OpenOpenAlexFDO

Authors 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

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

Review text

Es wird gezeigt: Wenn A erfüllbar ist und fast universal bezüglich P, so ist Circum(A;P) erfüllbar. Wenn A universal und erfüllbar ist, so ist Circum(A;P;Q) erfüllbar. Für disjunkte \(P^ 1,...,P^ k\), Q und jedes universale, erfüllbare A ist Circum(A,\(P^ 1>...>P^ k,Q)\) erfüllbar.

Recommendations

• On the computability of circumscription
• scientific article; zbMATH DE number 1189101
• A theorem on the consistency of circumscription
• Circumscription and implicit definability
• Decidability and definability with circumscription
• Completeness results for circumscription
• scientific article; zbMATH DE number 67498
• A dichotomy in the complexity of propositional circumscription
• scientific article; zbMATH DE number 2213633
• A constructive investigation of satisfiability

Cites work

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

Cited in

(28)

• Negation as failure: careful closure procedure
• Autocircumscription
• A generalization of collapsible cases of circumscription
• The importance of open and recursive circumscription
• 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
• Automatically generating abstractions for planning
• Deriving properties of belief update from theories of action
• Exploiting the normative aspect of preference: A deontic logic without actions
• Circumscriptive semantics for updating knowledge bases
• On compact representations of propositional circumscription
• Prioritized logic programming and its application to commonsense reasoning
• Default reasoning by deductive planning
• ECWA made easy
• Annotation theories over finite graphs
• An extension of pointwise circumscription
• Some computational aspects of circumscription
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Is there an alternative to parsimonious semantics?
• scientific article; zbMATH DE number 2213633 (Why is no real title available?)
• A theorem on the consistency of circumscription
• Using approximate reasoning to represent default knowledge
• Decidability and definability with circumscription
• Circumscription: Completeness reviewed
• A new deductive approach to planning

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073786)