Pages that link to "Item:Q5277767"
From MaRDI portal
The following pages link to Compilability of propositional abduction (Q5277767):
Displaying 7 items.
- Counting complexity of propositional abduction (Q988576) (← links)
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles (Q1274977) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Bi-Abduction with Pure Properties for Specification Inference (Q2937788) (← links)
- On computing all abductive explanations from a propositional Horn theory (Q3546348) (← links)
- Completeness for cut-based abduction (Q5176673) (← links)
- The merits of compositional abstraction: a case study in propositional logic (Q6165816) (← links)