Complexity Results for Nonmonotonic Logics
From MaRDI portal
Publication:4018170
Recommendations
- scientific article; zbMATH DE number 6131588
- A survey of complexity results for non-monotonic logics
- On the parameterized complexity of non-monotonic logics
- Proof-complexity results for nonmonotonic reasoning
- Publication:5749280
- Proof complexity of non-classical logics
- Proof Complexity of Non-classical Logics
- scientific article; zbMATH DE number 517061
- Nonmonotonic reasoning: From complexity to algorithms
Cited in
(78)- The computational complexity of ideal semantics
- Fixed points in propositional nonmonotonic logic
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Nonmonotonic reasoning: From complexity to algorithms
- Inheritance comes of age: applying nonmonotonic techniques to problems in industry
- Prolog technology for default reasoning: proof theory and compilation techniques
- Succinctness as a source of complexity in logical formalisms
- Cumulative default logic: Finite characterization, algorithms, and complexity
- Querying disjunctive databases through nonmonotonic logics
- Multi-valued autoepistemic logic
- Is intractability of nonmonotonic reasoning a real drawback?
- Fixed-parameter tractability of disjunction-free default reasoning
- Semantics and complexity of abduction from default theories
- 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
- Yet some more complexity results for default logic
- Restricted semantics for default reasoning
- Minimal temporal epistemic logic
- 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
- Reasoning with power defaults
- A decision method for nonmonotonic reasoning based on autoepistemic reasoning
- Default reasoning by deductive planning
- A new methodology for query answering in default logics via structure-oriented theorem proving
- 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
- On the decidability and complexity of reasoning about only knowing
- Representation results for non-cumulative logics
- Default reasoning using classical logic
- Connecting fuzzy logic and argumentation frames via logical attack principles
- Only knowing with degrees of confidence
- Redundancy in logic. III: Non-monotonic reasoning
- Combining answer set programming with description logics for the semantic web
- Outlier detection using default reasoning
- A recipe for the complexity analysis of non-classical logics
- Strong Backdoors for Default Logic
- Privacy preservation using multi-context systems and default logic
- Well-supported semantics for logic programs with generalized rules
- On the Complexity of Input/Output Logic
- Rule Calculus: Semantics, Axioms and Applications
- Proof-complexity results for nonmonotonic reasoning
- The Complexity of Reasoning for Fragments of Default Logic
- A Default Logic Patch for Default Logic
- scientific article; zbMATH DE number 3903964 (Why is no real title available?)
- A survey of non-monotonic reasoning
- A survey of complexity results for non-monotonic logics
- scientific article; zbMATH DE number 517061 (Why is no real title available?)
- On the impact of stratification on the complexity of nonmonotonic reasoning
- Finding explanations of inconsistency in multi-context systems
- Skeptical query-answering in Constrained Default Logic
- Restricted default theories: expressive power and outlier detection tasks
- Generalized compactness of nonmonotonic inference operations
- Analytic tableaux for default logics
- scientific article; zbMATH DE number 6131588 (Why is no real title available?)
- On the parameterized complexity of non-monotonic logics
- The complexity class θp2: Recent results and applications in AI and modal logic
- Skeptical rational extensions
- Reasoning with stratified default theories
- Ordering default theories and nonmonotonic logic programs
- scientific article; zbMATH DE number 4183390 (Why is no real title available?)
- Proof complexity of non-classical logics
- Proof Complexity of Non-classical Logics
- Default logic and bounded treewidth
- Non-monotonic reasoning via dynamic consequence
- Proof complexity of propositional default logic
- Strong backdoors for default logic
- Strong backdoors for default logic
- Graded hypothesis theories
- AI Planning Languages Semantics
- Verified SAT-Based AI Planning
- Upper Bounding Diameters of State Spaces of Factored Transition Systems
- Enhancing disjunctive logic programming systems by SAT checkers
- Reasoning with infinite stable models
- General default logic
- Reasoning under inconsistency: a forgetting-based approach
This page was built for publication: Complexity Results for Nonmonotonic Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018170)
