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