The following pages link to Computer Science Logic (Q5292637):
Displaying 5 items.
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- On the complexity of second-best abductive explanations (Q899129) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
