The following pages link to (Q4418672):
Displaying 8 items.
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- On the counting complexity of propositional circumscription (Q963360) (← links)
- The complexity of model checking for circumscriptive formulae (Q1205713) (← links)
- A dichotomy in the complexity of propositional circumscription (Q1764422) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)