Pages that link to "Item:Q2389658"

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

Displaying 9 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 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)
• (Q4553280) (← links)