Pages that link to "Item:Q1391128"
From MaRDI portal
The following pages link to On compact representations of propositional circumscription (Q1391128):
Displaying 7 items.
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- Definability for model counting (Q2303508) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
