Pages that link to "Item:Q5470752"
From MaRDI portal
The following pages link to A Complete Classification of the Complexity of Propositional Abduction (Q5470752):
Displaying 17 items.
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas (Q946041) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- Propositional truth maintenance systems: Classification and complexity analysis (Q1924776) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- On computing all abductive explanations from a propositional Horn theory (Q3546348) (← links)
- (Q4553280) (← links)
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation (Q4999294) (← links)
- Completeness for cut-based abduction (Q5176673) (← links)
- Compilability of propositional abduction (Q5277767) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- (Q5863854) (← links)
