The following pages link to (Q4268444):
Displaying 24 items.
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- An efficient algorithm for Horn description (Q1029007) (← links)
- Double Horn functions (Q1271644) (← links)
- Error-free and best-fit extensions of partially defined Boolean functions (Q1383161) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- Logical analysis of binary data with missing bits (Q1606295) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms (Q1861581) (← links)
- Reasoning with ordered binary decision diagrams (Q1878409) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Inner-core and outer-core functions of partially defined Boolean functions (Q1961465) (← links)
- On the dualization in distributive lattices and related problems (Q2030249) (← links)
- Probably approximately correct learning of Horn envelopes from queries (Q2286380) (← 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)
- On the difference of Horn theories (Q5929916) (← links)
