The complexity of logic-based abduction
From MaRDI portal
Recommendations
Cited in
(84)- Dischargeable obligations in the \(\mathcal{S}\)CIFF framework
- Semantic relevance
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction
- Belief extrapolation (or how to reason about observations and unpredicted change)
- Abduction from logic programs: Semantics and complexity
- A measure of arbitrariness in abductive explanations
- The computational complexity of understanding binary classifier decisions
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- Outlier detection using default reasoning
- A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials
- Support set selection for abductive and default reasoning
- scientific article; zbMATH DE number 1531965 (Why is no real title available?)
- A dialectical formalisation of preferred subtheories reasoning under resource bounds
- Constructing NP-intermediate problems by blowing holes with parameters of various properties
- On the failings of Shapley values for explainability
- Propensity and probability in depositional facies analysis and modeling
- Reasoning with ordered binary decision diagrams
- On some tractable classes in deduction and abduction
- Explanations for query answers under existential rules
- The complexity of handling minimal solutions in logic-based abduction
- The complexity of handling minimal solutions in logic-based abduction
- Complexity Classifications for Logic-Based Argumentation
- scientific article; zbMATH DE number 2032415 (Why is no real title available?)
- Minimal sets on propositional formulae. Problems and reductions
- Let Us investigate! Dynamic conjecture-making as the formal logic of abduction
- Algorithms for generating arguments and counterarguments in propositional logic
- Succinctness as a source of complexity in logical formalisms
- scientific article; zbMATH DE number 7385372 (Why is no real title available?)
- A decision method for nonmonotonic reasoning based on autoepistemic reasoning
- Super-Solutions
- Prioritized logic programming and its application to commonsense reasoning
- scientific article; zbMATH DE number 4166861 (Why is no real title available?)
- A Complete Classification of the Complexity of Propositional Abduction
- scientific article; zbMATH DE number 2000816 (Why is no real title available?)
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
- Expressiveness of communication in answer set programming
- On the complexity of inconsistency measurement
- Feature necessity and relevancy in machine learning explanations
- Explaining robust additive utility models by sequences of preference swaps
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Identifying efficient abductive hypotheses using multicriteria dominance relation
- What makes propositional abduction tractable
- On the complexity of second-best abductive explanations
- A split-combination approach to merging knowledge bases in possibilistic logic
- An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies
- Counting complexity of propositional abduction
- Solving conflicts in information merging by a flexible interpretation of atomic propositions
- Morphologic for knowledge dynamics: revision, fusion and abduction
- Abductive consequence relations
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results
- Generalized completeness for SOS resolution and its application to a new notion of relevance
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Comparing action descriptions based on semantic preferences
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases
- Outlier detection for simple default theories
- Ordered binary decision diagrams as knowledge-bases
- scientific article; zbMATH DE number 820414 (Why is no real title available?)
- scientific article; zbMATH DE number 6970794 (Why is no real title available?)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
- On the parameterized complexity of non-monotonic logics
- Efficient reasoning for inconsistent Horn formulae
- Semantics and complexity of abduction from default theories
- Complexity classifications for propositional abduction in Post's framework
- Parameterized complexity classes beyond para-NP
- The complexity class θp2: Recent results and applications in AI and modal logic
- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction
- A method of solving abductive reasoning problems via hitting set
- Complexity results for abductive logic programming
- Abductive Equivalence in First-order Logic
- Encoding deductive argumentation in quantified Boolean formulae
- Inference to the stable explanations
- Semantic forgetting in answer set programming
- An extension-based approach to belief revision in abstract argumentation
- scientific article; zbMATH DE number 7455718 (Why is no real title available?)
- Feature necessity \& relevancy in ML classifier explanations
- Classical logic, argument and dialectic
- Enhancing disjunctive logic programming systems by SAT checkers
- Complexity results for explanations in the structural-model approach
- Approximating cost-based abduction is NP-hard
- Conditional independence in propositional logic.
- Minimal abductive solutions with explicit justification
- Merge, explain, iterate: a combination of MHS and MXP in an ABox abduction solver
- On look-ahead heuristics in disjunctive logic programming
This page was built for publication: The complexity of logic-based abduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369855)
