The following pages link to Reasoning with models (Q2676579):
Displaying 22 items.
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- On the Boolean connectivity problem for Horn relations (Q608293) (← links)
- The complexity of reasoning with FODD and GFODD (Q900300) (← links)
- Translation among CNFs, characteristic models and ordered binary decision diagrams (Q1007523) (← links)
- Defaults and relevance in model-based reasoning (Q1127354) (← links)
- Is intractability of nonmonotonic reasoning a real drawback? (Q1391905) (← links)
- Variations on extending partially defined Boolean functions with missing bits. (Q1400581) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- Ordered binary decision diagrams as knowledge-bases (Q1605409) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- The incremental satisfiability problem for a two conjunctive normal form (Q1744433) (← links)
- Reasoning with ordered binary decision diagrams (Q1878409) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- Learning taxonomic relation by case-based reasoning (Q2581362) (← links)
- (Q4625699) (← links)
- On the difference of Horn theories (Q5929916) (← links)
- Matroid Horn functions (Q6187338) (← links)
- Hypergraph Horn functions (Q6499011) (← links)
