What makes propositional abduction tractable
From MaRDI portal
Reasoning under uncertainty in the context of artificial intelligence (68T37) Other nonclassical logic (03B60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Logic in artificial intelligence (68T27)
Recommendations
Cites work
- scientific article; zbMATH DE number 3650557 (Why is no real title available?)
- scientific article; zbMATH DE number 1946872 (Why is no real title available?)
- scientific article; zbMATH DE number 1962835 (Why is no real title available?)
- scientific article; zbMATH DE number 2000816 (Why is no real title available?)
- scientific article; zbMATH DE number 2086980 (Why is no real title available?)
- scientific article; zbMATH DE number 824740 (Why is no real title available?)
- A Complete Classification of the Complexity of Propositional Abduction
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Abduction from logic programs: Semantics and complexity
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting
- Bases for Boolean co-clones
- Closed systems of functions and predicates
- Compilability of propositional abduction
- Complexity of Default Logic on Generalized Conjunctive Queries
- Consequence finding algorithms
- Counting complexity of propositional abduction
- Horn approximations of empirical data
- Hypothesis generation by machine
- Knowledge compilation and theory approximation
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Logic for Programming, Artificial Intelligence, and Reasoning
- On Cores and Prime Implicants of Truth Functions
- On computing all abductive explanations from a propositional Horn theory
- On some tractable classes in deduction and abduction
- On the Structure of Polynomial Time Reducibility
- Preprocessing of intractable problems
- Reasoning with models
- Reasoning with ordered binary decision diagrams
- Semantics and complexity of abduction from default theories
- Structure identification of Boolean relations and plain bases for co-clones
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- The complexity of logic-based abduction
- The complexity of satisfiability problems
- The computational complexity of abduction
Cited in
(20)- Computer Science Logic
- The ghosts of forgotten things: a study on size after forgetting
- Compilability of propositional abduction
- The union of minimal hitting sets: parameterized combinatorial bounds and counting
- Constructing NP-intermediate problems by blowing holes with parameters of various properties
- Propensity and probability in depositional facies analysis and modeling
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
- Reasoning with ordered binary decision diagrams
- Parameterized complexity of abduction in Schaefer's framework
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Complexity Classifications for Logic-Based Argumentation
- scientific article; zbMATH DE number 4166861 (Why is no real title available?)
- A Complete Classification of the Complexity of Propositional Abduction
- On the complexity of second-best abductive explanations
- Counting complexity of propositional abduction
- scientific article; zbMATH DE number 6970794 (Why is no real title available?)
- Semantics and complexity of abduction from default theories
- Complexity classifications for propositional abduction in Post's framework
- scientific article; zbMATH DE number 140373 (Why is no real title available?)
- Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework
This page was built for publication: What makes propositional abduction tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389658)
