The Complexity of Circumscriptive Inference in Post’s Lattice

DOI10.1007/978-3-642-04238-6_25MaRDI QIDQ3643126zbMATH OpenOpenAlexFDO

Authors

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_25

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• The complexity of circumscriptive inference in Post's lattice
• A dichotomy in the complexity of propositional circumscription
• The computational complexity of propositional cirquent calculus
• On the counting complexity of propositional circumscription
• The complexity of theorem proving in circumscription and minimal entailment
• Complexity classifications for propositional abduction in Post's framework
• scientific article; zbMATH DE number 3935022
• On the complexity of inductive inference
• The exact complexity of the infinite Post Correspondence Problem
• Inconsistency Tolerance

Cited in

(8)

• The complexity of propositional closed world reasoning and circumscription
• A dichotomy in the complexity of propositional circumscription
• On the applicability of Post's lattice
• Approximate reasoning with credible subsets
• Complexity of propositional nested circumscription and nested abnormality theories
• The weight in enumeration
• The complexity of circumscriptive inference in Post's lattice
• Trichotomies in the complexity of minimal inference

This page was built for publication: The Complexity of Circumscriptive Inference in Post’s Lattice

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