Pages that link to "Item:Q4369855"
From MaRDI portal
The following pages link to The complexity of logic-based abduction (Q4369855):
Displaying 50 items.
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Belief extrapolation (or how to reason about observations and unpredicted change) (Q543623) (← links)
- Outlier detection for simple default theories (Q622112) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
- Solving conflicts in information merging by a flexible interpretation of atomic propositions (Q650523) (← links)
- A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials (Q692280) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Approximating cost-based abduction is NP-hard (Q814635) (← links)
- Propensity and probability in depositional facies analysis and modeling (Q844090) (← links)
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Abductive consequence relations (Q1399126) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Prioritized logic programming and its application to commonsense reasoning (Q1589476) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints (Q1678427) (← links)
- Classical logic, argument and dialectic (Q1711878) (← links)
- Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction (Q1726251) (← links)
- An extension-based approach to belief revision in abstract argumentation (Q1726407) (← links)
- Conditional independence in propositional logic. (Q1852858) (← links)
- Reasoning with ordered binary decision diagrams (Q1878409) (← links)
- A decision method for nonmonotonic reasoning based on autoepistemic reasoning (Q1891263) (← links)
- On some tractable classes in deduction and abduction (Q1978251) (← links)
- Generalized completeness for SOS resolution and its application to a new notion of relevance (Q2055868) (← links)
- Semantic relevance (Q2104509) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Explaining robust additive utility models by sequences of preference swaps (Q2362181) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Outlier detection using default reasoning (Q2389688) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
- Comparing action descriptions based on semantic preferences (Q2457799) (← links)
- A split-combination approach to merging knowledge bases in possibilistic logic (Q2643150) (← links)
- Inference to the stable explanations (Q2694572) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Super-Solutions (Q2946725) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation (Q2946739) (← links)
