Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Theories of computability
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions (Art of Computer Programming)
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Boolean approximation revisited
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Hi-index | 0.00 |
Since Selman and Kautz's seminal work on the use of Horn approximation to speed up the querying of knowledge bases, there has been great interest in Boolean approximation for AI applications. There are several Boolean classes with desirable computational properties similar to those of the Horn class. The class of affine Boolean functions, for example, has been proposed as an interesting alternative to Horn for knowledge compilation. To investigate the trade-offs between precision and efficiency in knowledge compilation, we compare, analytically and empirically, four well-known Boolean classes, and their combinations, for ability to preserve information. We note that traditional evaluation which explores unit-clause consequences of random hard 3-CNF formulas does not tell the full story, and we complement that evaluation with experiments based on a variety of assumptions about queries and the underlying knowledge base.