An efficient method for eliminating varying predicates from a circumscription

DOI10.1016/0004-3702(92)90051-XzbMath0762.03013WikidataQ59259770 ScholiaQ59259770MaRDI QIDQ1193478

Georg Gottlob, Thomas Eiter, Marco Cadoli

Publication date: 27 September 1992

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

zbMATH Keywords

formalization of common-sense reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Other applications of logic (03B80)

Related Items

The complexity of propositional closed world reasoning and circumscription, An extension of pointwise circumscription, Embedding circumscriptive theories in general disjunctive programs, Reducing belief revision to circumscription (and vice versa), Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, Note about cardinality-based circumscription

Cites Work

• Decidability and definability with circumscription
• Saturation, nonmonotonic reasoning and the closed-world assumption
• Closed-world databases and circumscription
• Negation as failure: careful closure procedure
• On the relationship between circumscription and negation as failure
• An algorithm to compute circumscription
• Eliminating the fixed predicates from a circumscription
• A circumscriptive theorem prover
• Circumscription - a form of non-monotonic reasoning
• Deduction in non-Horn databases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item