The complexity of circumscriptive inference in Post's lattice

DOI10.1007/S00224-010-9311-6MaRDI QIDQ692903zbMATH OpenOpenAlexFDO

Authors M. C. Fu

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

zbMATH Keywords

complexity theorynonmonotonic reasoningcircumscriptionPost's lattice

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• The Complexity of Circumscriptive Inference in Post’s Lattice
• A dichotomy in the complexity of propositional circumscription
• Logic for Programming, Artificial Intelligence, and Reasoning
• scientific article; zbMATH DE number 1962835
• scientific article; zbMATH DE number 1884382

Cites work

• scientific article; zbMATH DE number 1688380 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1061261 (Why is no real title available?)
• scientific article; zbMATH DE number 1962835 (Why is no real title available?)
• scientific article; zbMATH DE number 1453080 (Why is no real title available?)
• A dichotomy in the complexity of propositional circumscription
• Circumscription - a form of non-monotonic reasoning
• Generalized Modal Satisfiability
• Logic for Programming, Artificial Intelligence, and Reasoning
• Mathematical Foundations of Computer Science 2003
• On compact representations of propositional circumscription
• On the relationship between circumscription and negation as failure
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Satisfiability problems for propositional calculi
• Structure and importance of logspace-MOD class
• THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆
• The Complexity of Circumscriptive Inference in Post’s Lattice
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• The Complexity of Reasoning for Fragments of Default Logic
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• The complexity of minimal satisfiability problems
• The complexity of model checking for Boolean formulas
• The complexity of propositional closed world reasoning and circumscription
• The complexity of propositional implication
• The complexity of satisfiability problems

Cited in

(8)

• scientific article; zbMATH DE number 762062 (Why is no real title available?)
• The Complexity of Circumscriptive Inference in Post’s Lattice
• The complexity of propositional implication
• scientific article; zbMATH DE number 611096 (Why is no real title available?)
• The complexity of propositional closed world reasoning and circumscription
• A dichotomy in the complexity of propositional circumscription
• Complexity of propositional nested circumscription and nested abnormality theories
• scientific article; zbMATH DE number 1696754 (Why is no real title available?)

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 Q692903)