Semantics and complexity of abduction from default theories
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A logic for default reasoning
- A logical framework for default reasoning
- A survey of complexity results for non-monotonic logics
- Abduction versus closure in causal theories.
- Abductive Logic Programming
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Complexity results for abductive logic programming
- Complexity Results for Nonmonotonic Logics
- Ground Nonmonotonic Modal Logics
- Hard problems for simple default logics
- scientific article; zbMATH DE number 5899491 (Why is no real title available?)
- scientific article; zbMATH DE number 3978432 (Why is no real title available?)
- scientific article; zbMATH DE number 47350 (Why is no real title available?)
- scientific article; zbMATH DE number 97788 (Why is no real title available?)
- scientific article; zbMATH DE number 140373 (Why is no real title available?)
- scientific article; zbMATH DE number 140388 (Why is no real title available?)
- scientific article; zbMATH DE number 478394 (Why is no real title available?)
- scientific article; zbMATH DE number 611094 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 1531968 (Why is no real title available?)
- scientific article; zbMATH DE number 4185062 (Why is no real title available?)
- scientific article; zbMATH DE number 4185074 (Why is no real title available?)
- Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- On Approximation Algorithms for # P
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the hardness of approximate reasoning
- On the Relationship Between Abduction and Deduction
- Probabilistic Horn abduction and Bayesian networks
- Second order logic and the weak exponential hierarchies
- Structure and complexity of relational queries
- The complexity of default reasoning under the stationary fixed point semantics
- The complexity of logic-based abduction
- The computational complexity of abduction
- Tractable reasoning via approximation
Cited in
(22)- Abduction from logic programs: Semantics and complexity
- Abductive reasoning through filtering
- Constructing NP-intermediate problems by blowing holes with parameters of various properties
- Probabilistic qualification of attack in abstract argumentation
- What makes propositional abduction tractable
- Outlier detection using default reasoning
- Support set selection for abductive and default reasoning
- Inference to the stable explanations
- Towards an efficient library for SAT: A manifesto
- Consequence finding algorithms
- Super-Solutions
- scientific article; zbMATH DE number 4174356 (Why is no real title available?)
- Seminormalizing a default theory
- The complexity of logic-based abduction
- scientific article; zbMATH DE number 2032415 (Why is no real title available?)
- Abducible Semantics and Argumentation
- A weighted causal theory for acquiring and utilizing open knowledge
- Abduction in well-founded semantics and generalized stable models via tabled dual programs
- Complexity results for abductive logic programming
- Outlier detection for simple default theories
- Explanations for query answers under existential rules
- On the complexity of second-best abductive explanations
This page was built for publication: Semantics and complexity of abduction from default theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402749)
