Complexity Results for Nonmonotonic Logics
From MaRDI portal
Publication:4018170
DOI10.1093/logcom/2.3.397zbMath0765.03012OpenAlexW1997714358WikidataQ59259771 ScholiaQ59259771MaRDI QIDQ4018170
Publication date: 16 January 1993
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/2.3.397
Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Reasoning with power defaults, Cumulative default logic: Finite characterization, algorithms, and complexity, Only knowing with degrees of confidence, Privacy Preservation Using Multi-context Systems and Default Logic, Well-Supported Semantics for Logic Programs with Generalized Rules, A decision method for nonmonotonic reasoning based on autoepistemic reasoning, The complexity class θp2: Recent results and applications in AI and modal logic, Querying disjunctive databases through nonmonotonic logics, On the Complexity of Input/Output Logic, Default reasoning by deductive planning, A new methodology for query answering in default logics via structure-oriented theorem proving, Redundancy in logic. III: Non-monotonic reasoning, Combining answer set programming with description logics for the semantic web, Outlier detection using default reasoning, Default reasoning using classical logic, Multi-valued autoepistemic logic, Propositional truth maintenance systems: Classification and complexity analysis, On the computational cost of disjunctive logic programming: Propositional case, Complexity of computing with extended propositional logic programs, Is intractability of nonmonotonic reasoning a real drawback?, Skeptical rational extensions, Reasoning with stratified default theories, On the impact of stratification on the complexity of nonmonotonic reasoning, Fixed-parameter tractability of disjunction-free default reasoning, Semantics and complexity of abduction from default theories, Non-monotonic reasoning via dynamic consequence, Analytic tableaux for default logics, Proof complexity of propositional default logic, Rule Calculus: Semantics, Axioms and Applications, Finding explanations of inconsistency in multi-context systems, Skeptical query-answering in Constrained Default Logic, Restricted default theories: expressive power and outlier detection tasks, On the decidability and complexity of reasoning about only knowing, On the parameterized complexity of non-monotonic logics, Graded hypothesis theories, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Restricted semantics for default reasoning, A survey of non-monotonic reasoning, Ordering default theories and nonmonotonic logic programs, General default logic, Reasoning under inconsistency: a forgetting-based approach, Default logic and bounded treewidth, Proof Complexity of Non-classical Logics, Strong Backdoors for Default Logic, The Complexity of Reasoning for Fragments of Default Logic, Minimal temporal epistemic logic, A Default Logic Patch for Default Logic, Inheritance comes of age: applying nonmonotonic techniques to problems in industry, Prolog technology for default reasoning: proof theory and compilation techniques, Connecting fuzzy logic and argumentation frames via logical attack principles, The computational complexity of ideal semantics, Succinctness as a source of complexity in logical formalisms, Prioritized logic programming and its application to commonsense reasoning, Alternative foundations for Reiter's default logic, Default reasoning from conditional knowledge bases: Complexity and tractable cases, On the computational complexity of assumption-based argumentation for default reasoning., Propositional default logics made easier: computational complexity of model checking., Uniform semantic treatment of default and autoepistemic logics, Yet some more complexity results for default logic, Enhancing disjunctive logic programming systems by SAT checkers, Reasoning with infinite stable models
