Knowledge compilation and theory approximation
From MaRDI portal
Publication:4371669
DOI10.1145/226643.226644zbMath0882.68137OpenAlexW2038897673MaRDI QIDQ4371669
Publication date: 21 January 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/
Related Items
Tractable approximate deduction for OWL ⋮ Inter-definability of Horn contraction and Horn revision ⋮ The universe of propositional approximations ⋮ SAT-Based Horn Least Upper Bounds ⋮ What makes propositional abduction tractable ⋮ Unnamed Item ⋮ Efficient query processing with reduced implicate tries ⋮ Defaults and relevance in model-based reasoning ⋮ Belief revision within fragments of propositional logic ⋮ On simplification of schema mappings ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Construction and learnability of canonical Horn formulas ⋮ Reasoning about actions with loops via Hoare logic ⋮ Disjunctive closures for knowledge compilation ⋮ First order LUB approximations: characterization and algorithms ⋮ A subclass of Horn CNFs optimally compressible in polynomial time ⋮ On the difference of Horn theories ⋮ Annotation theories over finite graphs ⋮ Polynomial certificates for propositional classes ⋮ Information loss in knowledge compilation: a comparison of Boolean envelopes ⋮ Consistency restoration and explanations in dynamic CSPs---Application to configuration ⋮ Belief revision in Horn theories ⋮ The applicability of logic program analysis and transformation to theorem proving ⋮ Learning to assign degrees of belief in relational domains ⋮ Computational Aspects of Quasi-Classical Entailment ⋮ Join on Closure Systems Using Direct Implicational Basis Representation ⋮ Horn representation of a concept lattice ⋮ Approximate coherence-based reasoning ⋮ Exact knowledge compilation in predicate calculus: The partial achievement case ⋮ Semantical and computational aspects of Horn approximations ⋮ Approximation Schemes in Logic and Artificial Intelligence ⋮ Preprocessing of intractable problems ⋮ Horn approximations of empirical data ⋮ On functional dependencies in \(q\)-Horn theories ⋮ 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
