The complexity of circumscriptive inference in Post's lattice
From MaRDI portal
Publication:692903
DOI10.1007/s00224-010-9311-6zbMath1282.68144OpenAlexW2019366780MaRDI QIDQ692903
Publication date: 6 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9311-6
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of propositional implication
- On the relationship between circumscription and negation as failure
- Circumscription - a form of non-monotonic reasoning
- The complexity of propositional closed world reasoning and circumscription
- On compact representations of propositional circumscription
- A dichotomy in the complexity of propositional circumscription
- The complexity of minimal satisfiability problems
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS
- The Complexity of Reasoning for Fragments of Default Logic
- The Complexity of Circumscriptive Inference in Post’s Lattice
- THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
- Satisfiability problems for propositional calculi
- Structure and importance of logspace-MOD class
- The complexity of satisfiability problems
- Mathematical Foundations of Computer Science 2003
- Generalized Modal Satisfiability
- Logic for Programming, Artificial Intelligence, and Reasoning
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
This page was built for publication: The complexity of circumscriptive inference in Post's lattice
