Pages that link to "Item:Q963360"
From MaRDI portal
The following pages link to On the counting complexity of propositional circumscription (Q963360):
Displaying 10 items.
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- Some computational aspects of circumscription (Q3474909) (← links)
- The Complexity of Circumscriptive Inference in Post’s Lattice (Q3643126) (← links)
- (Q4418672) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705928) (← links)