The following pages link to (Q4386975):
Displaying 8 items.
- Belief revision within fragments of propositional logic (Q386044) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- The complexity of theory revision (Q1606294) (← links)
- The size of a revised knowledge base (Q1978467) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
