Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation.
Peter L. HammerAlexander KoganPublished in: Artif. Intell. (1993)
Keyphrases
- worst case
- knowledge base
- error tolerance
- propositional logic
- np hard
- approximation error
- closed form
- dynamic programming
- approximation algorithms
- increase in computational complexity
- polynomial hierarchy
- knowledge compilation
- semantic network
- approximation schemes
- horn clauses
- knowledge based systems
- knowledge acquisition
- image compression
- description logics
- lower bound
- optimal solution
- compression algorithm
- data compression
- error bounds
- probabilistic logic
- possibilistic logic
- propositional formulas
- upper bound
- computational complexity
- propositional knowledge base