Reasoning with models
From MaRDI portal
Publication:2676579
DOI10.1016/S0004-3702(96)00006-9zbMath1506.68149MaRDI QIDQ2676579
Publication date: 27 September 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Mechanization of proofs and logical operations (03B35)
Related Items (21)
Reasoning with ordered binary decision diagrams ⋮ What makes propositional abduction tractable ⋮ Defaults and relevance in model-based reasoning ⋮ On the Boolean connectivity problem for Horn relations ⋮ Is intractability of nonmonotonic reasoning a real drawback? ⋮ Variations on extending partially defined Boolean functions with missing bits. ⋮ Construction and learnability of canonical Horn formulas ⋮ The complexity of reasoning with FODD and GFODD ⋮ Matroid Horn functions ⋮ The incremental satisfiability problem for a two conjunctive normal form ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Learning definite Horn formulas from closure queries ⋮ On the difference of Horn theories ⋮ Polynomial certificates for propositional classes ⋮ Translation among CNFs, characteristic models and ordered binary decision diagrams ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Semantical and computational aspects of Horn approximations ⋮ Unnamed Item ⋮ Learning taxonomic relation by case-based reasoning ⋮ Ordered binary decision diagrams as knowledge-bases ⋮ On functional dependencies in \(q\)-Horn theories
Cites Work
- Unnamed Item
- Unnamed Item
- Design by example: An application of Armstrong relations
- Structure identification in relational data
- Model-preference default theories
- On the hardness of approximate reasoning
- On the Structure of Armstrong Relations for Functional Dependencies
- Horn clauses and database dependencies
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- The Semantics of Predicate Logic as a Programming Language
- Learning to reason
- On sentences which are true of direct unions of algebras
- The decision problem for some classes of sentences without quantifiers
This page was built for publication: Reasoning with models