Pages that link to "Item:Q4371669"
From MaRDI portal
The following pages link to Knowledge compilation and theory approximation (Q4371669):
Displayed 36 items.
- Tractable approximate deduction for OWL (Q274420) (← links)
- Belief revision within fragments of propositional logic (Q386044) (← links)
- On simplification of schema mappings (Q389226) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Disjunctive closures for knowledge compilation (Q460617) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases (Q814499) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- Learning to assign degrees of belief in relational domains (Q1009279) (← links)
- Defaults and relevance in model-based reasoning (Q1127354) (← links)
- Semantical and computational aspects of Horn approximations (Q1575175) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- Inter-definability of Horn contraction and Horn revision (Q2363417) (← links)
- The universe of propositional approximations (Q2369011) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- Belief revision in Horn theories (Q2512985) (← links)
- (Q2741519) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Join on Closure Systems Using Direct Implicational Basis Representation (Q3627735) (← links)
- Horn representation of a concept lattice (Q3631392) (← links)
- Computational Aspects of Quasi-Classical Entailment (Q4443010) (← links)
- Approximate coherence-based reasoning (Q4453903) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Exact knowledge compilation in predicate calculus: The partial achievement case (Q5234699) (← links)
- Approximation Schemes in Logic and Artificial Intelligence (Q5505446) (← links)
- On the difference of Horn theories (Q5929916) (← links)
- Consistency restoration and explanations in dynamic CSPs---Application to configuration (Q5958543) (← links)