scientific article; zbMATH DE number 512816
From MaRDI portal
Publication:4281509
Recommendations
Cited in
(50)- The computational complexity of abduction
- The approximation of implicates and explanations
- Intuitive minimal abduction in sequent calculi
- Abduction from logic programs: Semantics and complexity
- Semantics and complexity of abduction from default theories
- Let Us investigate! Dynamic conjecture-making as the formal logic of abduction
- Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction
- Tractable reasoning via approximation
- On some tractable classes in deduction and abduction
- Parameterised complexity of abduction in Schaefer's framework
- Abductive reasoning in explanation problems of an observed effect
- Generation and selection of abductive explanations for non-omniscient agents
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results
- What makes propositional abduction tractable
- Abductive reasoning in neural-symbolic systems
- Support set selection for abductive and default reasoning
- Large-scale cost-based abduction in full-fledged first-order predicate logic with cutting plane inference
- A measure of arbitrariness in abductive explanations
- The complexity of handling minimal solutions in logic-based abduction
- Complexity classifications for propositional abduction in Post's framework
- A Formal Logic for Abductive Reasoning
- Towards Abductive Reasoning in First-order Logic
- Abductive Equivalence in First-order Logic
- A method of solving abductive reasoning problems via hitting set
- scientific article; zbMATH DE number 4166861 (Why is no real title available?)
- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
- Abduction and consequence generation in a support system for the design of logical multiple-choice questions
- scientific article; zbMATH DE number 140373 (Why is no real title available?)
- scientific article; zbMATH DE number 500950 (Why is no real title available?)
- Is there a prototypical rule of abduction? (Yes, e.g. in proximity based explanations)
- The complexity of logic-based abduction
- scientific article; zbMATH DE number 2000816 (Why is no real title available?)
- scientific article; zbMATH DE number 2032415 (Why is no real title available?)
- Abductive logic programs with penalization: semantics, complexity and implementation
- scientific article; zbMATH DE number 2086980 (Why is no real title available?)
- scientific article; zbMATH DE number 820414 (Why is no real title available?)
- scientific article; zbMATH DE number 834571 (Why is no real title available?)
- scientific article; zbMATH DE number 7385372 (Why is no real title available?)
- Parameterized complexity of abduction in Schaefer's framework
- Minimal abductive solutions with explicit justification
- Complexity results for abductive logic programming
- Indefinite abductive explanations
- The complexity of handling minimal solutions in logic-based abduction
- Computer Science Logic
- Topological aspects of matrix abduction. I
- A Complete Classification of the Complexity of Propositional Abduction
- Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver
- On the complexity of second-best abductive explanations
- Counting complexity of propositional abduction
- Abduction versus closure in causal theories.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281509)
