Pages that link to "Item:Q1764422"
From MaRDI portal
The following pages link to A dichotomy in the complexity of propositional circumscription (Q1764422):
Displaying 11 items.
- 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)
- On the satisfiability of circumscription (Q1073786) (← links)
- The complexity of model checking for circumscriptive formulae (Q1205713) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- The Complexity of Circumscriptive Inference in Post’s Lattice (Q3643126) (← links)
- (Q4418672) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705928) (← links)