On compact representations of propositional circumscription

DOI10.1016/S0304-3975(96)00182-XMaRDI QIDQ1391128zbMATH OpenWikidataFDO

Authors Marco Cadoli, Marco Schaerf, Riccardo Silvestri, Francesco Maria Donini

Publication date 22 July 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00182-X

zbMATH Keywords

polynomial-size representationsreasoning

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01) Knowledge representation (68T30)

Recommendations

• On compact representations of propositional circumscription
• A dichotomy in the complexity of propositional circumscription
• On the counting complexity of propositional circumscription
• The complexity of propositional closed world reasoning and circumscription
• Logic for Programming, Artificial Intelligence, and Reasoning
• The computational complexity of propositional cirquent calculus
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Circumscription and projection as primitives of logic programming
• On the satisfiability of circumscription

Cites work

• A generalization of collapsible cases of circumscription
• A logic for default reasoning
• An algorithm to compute circumscription
• Autoepistemic logic
• Circumscription - a form of non-monotonic reasoning
• Computing circumscriptive databases
• Deduction in non-Horn databases
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• Is intractability of nonmonotonic reasoning a real drawback?
• Minimal consequence in sentential logic
• On compact representations of propositional circumscription
• On the computability of circumscription
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Some computational aspects of circumscription
• Some consequences of non-uniform conditions on uniform classes
• The complexity of model checking for circumscriptive formulae
• The size of a revised knowledge base
• The well-founded semantics for general logic programs

Cited in

(19)

• Closed-world databases and circumscription
• Reducing belief revision to circumscription (and vice versa)
• Preprocessing of intractable problems
• The size of a revised knowledge base
• Definability for model counting
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Redundancy in logic. I: CNF propositional formulae
• Knowledge compilation for closed world reasoning and circumscription
• scientific article; zbMATH DE number 1696843 (Why is no real title available?)
• Circumscription and projection as primitives of logic programming
• Fixed-parameter algorithms for closed world reasoning
• scientific article; zbMATH DE number 4072898 (Why is no real title available?)
• Circumscription with homomorphisms
• scientific article; zbMATH DE number 1962835 (Why is no real title available?)
• On compact representations of propositional circumscription
• Complexity of propositional nested circumscription and nested abnormality theories
• The complexity of circumscriptive inference in Post's lattice
• Compiling propositional weighted bases
• Reasoning under minimal upper bounds in propositional logic

This page was built for publication: On compact representations of propositional circumscription

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