No article text was recorded for this version.
computational complexity of nonmonotonic reasoning
Version 2 of 2144 papers184 conceptsfrozen 2026-10-04
Papers in this version
- Blog: The Complexity of Circumscription in DLs
- Blog: It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics
- Blog: Preferred Arguments are Harder to Compute than
- Blog: Adding Default Attributes to EL++
- Blog: Default Inheritance Reasoning in Hybrid KL-ONE-Style Logics
- Blog: The Complexity of Closed World Reasoning and Circumscription
- Blog: Incorporating Nonmonotonic Reasoning in Horn Clause Theories
- Blog: Experimenting with Power Default Reasoning
- Blog: Constrained and Rational Default Logics
- Blog: The Complexity of Propositional Default Logics
- Blog: Default Inheritance Reasoning in Hybrid KL-ONE-style
- Blog: On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases
- Blog: Reasoning with Minimal Belief and Negation as Failure: Algorithms and Complexity
- Blog: Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity
- Blog: A Logic for Hypothetical Reasoning
- Blog: Reasoning about Typicality in Low Complexity DLs: The Logics
- Blog: Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
- Blog: Querying Circumscribed Description Logic Knowledge Bases
- Blog: Abducing Priorities to Derive Intended Conclusions
- Blog: Description Logics with Pointwise Circumscription
- Blog: Tweety - Still Flying: Some Remarks on Abnormal Birds Applicable Rules and a Default Prover
- Blog: Transforming Prioritized Defaults and Specificity into Parallel Defaults
- Blog: Complexity of Non-Monotonic Logics
- Blog: Inheritance Comes of Age: Applying Nonmonotonic Techniques to Problems in Industry
- Blog: Andrzcj Pamck
- Blog: Declarative and Computational Properties of Logic Programs with Aggregates
- Blog: Querying Circumscribed Description Logic Knowledge Bases (Extended Abstract)
- Blog: The Complexity of Reasoning for Fragments of Autoepistemic Logic
- Blog: Stable Model Checking Made Easy
- Blog: Choosing Directions for Rules
- Blog: Sound and Efficient Non-monotonic Inference
- Blog: Towards Efficient Default Reasoning
- Blog: Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic Logic and Probabilistic Logic under Coherence
- Blog: Discourse Relations and Defeasible Knowledge
- Blog: The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
- Blog: A Hybrid System DLclog Integrating Description Logics and Rules
- Blog: Decomposing Constraint Networks for Calculating c-Representations
- Blog: Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
- Blog: A Note on Reasoning on DL-LiteR with Defeasibility
- Blog: Reasoning about evolving nonmonotonic knowledge bases
- Blog: A Faithful Integration of Description Logics with Logic Programming
- Blog: Loop Formulas for Circumscription
- Blog: Finding Answers and Generating Explanations for Complex Biomedical Queries
- Blog: The Logic of Persistence
- Blog: The Data Complexity of Ontology-Mediated Queries with Closed Predicates
- Blog: Tableau vs. Sequent Calculi for Minimal Entailment
- Blog: On the Relation Between Autoepistem ic Logic and Circumscription
- Blog: Computing Default Logic Extensions: An Implementation
- Blog: On the Entailment Problem for a Logic of Typicality
- Blog: On the Complexity of
- Blog: The Logic of Inheritance in Frame Systems
- Blog: InfOCF-Web: An Online Tool for Nonmonotonic Reasoning with Conditionals and Ranking Functions
- Blog: Stratification for Variants of Default Logic
- Blog: Preferred Arguments are Harder to Compute than Stable Extension
- Blog: Backdoors to Tractability of Answer-Set Programming
- Blog: A Non-monotonic Logic for Specifying and Querying Preferences
- Blog: The Complexity of Probabilistic EL
- Blog: Default Logic, Propositional Logic, and Constraints
- Blog: Integrating Rules and Description Logics by Circumscription
- Blog: On the Parameterized Complexity of Default Logic and Autoepistemic Logic
Showing 60 of 144 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_computational_complexity_of_nonmonotonic_33dcfa3f,
title = {computational complexity of nonmonotonic reasoning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-nonmonotonic-reasoning/rdr_33dcfa3f231548c5b8814613c719de54},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_computational_complexity_of_nonmonotonic_33dcfa3f_v2,
title = {computational complexity of nonmonotonic reasoning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/computational-complexity-of-nonmonotonic-reasoning/rdr_33dcfa3f231548c5b8814613c719de54/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}