Pages that link to "Item:Q2389658"

The following pages link to What makes propositional abduction tractable (Q2389658):

Displaying 19 items.

• 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)
• The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
• The computational complexity of abduction (Q1182159) (← links)
• Semantics and complexity of abduction from default theories (Q1402749) (← links)
• Reasoning with ordered binary decision diagrams (Q1878409) (← links)
• On some tractable classes in deduction and abduction (Q1978251) (← links)
• The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
• Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
• Complexity Classifications for Propositional Abduction in Post's Framework (Q3165755) (← links)
• The complexity of logic-based abduction (Q4369855) (← links)
• (Q4553280) (← links)
• Parameterized complexity of abduction in Schaefer’s framework (Q5028318) (← links)
• Compilability of propositional abduction (Q5277767) (← links)
• Computer Science Logic (Q5292637) (← links)
• The ghosts of forgotten things: a study on size after forgetting (Q6560989) (← links)