Knowledge compilation and theory approximation
From MaRDI portal
Publication:4371669
Recommendations
Cited in
(55)- Learning to assign degrees of belief in relational domains
- Defaults and relevance in model-based reasoning
- Semantical and computational aspects of Horn approximations
- On functional dependencies in q-Horn theories
- Reasoning about actions with loops via Hoare logic
- Preprocessing of intractable problems
- Horn approximations of empirical data
- Knowledge compilation using the extension rule
- CoLab: A hybrid knowledge representation and compilation laboratory
- Propositional lower bounds: Algorithms and complexity
- Off-line reasoning for on-line efficiency: knowledge bases
- Annotation theories over finite graphs
- Inter-definability of Horn contraction and Horn revision
- The universe of propositional approximations
- What makes propositional abduction tractable
- First order LUB approximations: characterization and algorithms
- Polynomial certificates for propositional classes
- Belief revision in Horn theories
- SatEx: A web-based framework for SAT experimentation
- Tractable approximate deduction for OWL
- SAT-Based Horn Least Upper Bounds
- scientific article; zbMATH DE number 4162249 (Why is no real title available?)
- scientific article; zbMATH DE number 4162313 (Why is no real title available?)
- scientific article; zbMATH DE number 4166936 (Why is no real title available?)
- Join on Closure Systems Using Direct Implicational Basis Representation
- Horn representation of a concept lattice
- Belief revision within fragments of propositional logic
- On simplification of schema mappings
- Construction and learnability of canonical Horn formulas
- scientific article; zbMATH DE number 1301762 (Why is no real title available?)
- scientific article; zbMATH DE number 1149451 (Why is no real title available?)
- Computational Aspects of Quasi-Classical Entailment
- Approximate coherence-based reasoning
- scientific article; zbMATH DE number 1509480 (Why is no real title available?)
- Knowledge compilation of logic programs using approximation fixpoint theory
- Disjunctive closures for knowledge compilation
- A new method for knowledge compilation: The achievement by cycle search
- scientific article; zbMATH DE number 2086980 (Why is no real title available?)
- The applicability of logic program analysis and transformation to theorem proving
- Exact knowledge compilation in predicate calculus: the partial achievement case
- Normal Forms for Knowledge Compilation
- Automated Reasoning with Analytic Tableaux and Related Methods
- Approximation Schemes in Logic and Artificial Intelligence
- On the difference of Horn theories
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- On the role of logical separability in knowledge compilation
- Knowledge compilation. Preface.
- Techniques for measuring the inferential strength of forgetting policies
- A subclass of Horn CNFs optimally compressible in polynomial time
- Actively learning from machine learning models with queries and counterexamples
- Connecting knowledge compilation classes and width parameters
- Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases
- Compiling propositional weighted bases
- Efficient query processing with reduced implicate tries
- Information loss in knowledge compilation: a comparison of Boolean envelopes
This page was built for publication: Knowledge compilation and theory approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371669)
