Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Structure identification in relational data
Artificial Intelligence - Special volume on constraint-based reasoning
Horn approximations of empirical data
Artificial Intelligence
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantical and computational aspects of Horn approximations
Artificial Intelligence
Ordered binary decision diagrams as knowledge-bases
Artificial Intelligence
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters
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
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Information loss in knowledge compilation: A comparison of Boolean envelopes
Artificial Intelligence
Boolean affine approximation with binary decision diagrams
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Belief revision within fragments of propositional logic
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Most work to date on Boolean approximation assumes that Boolean functions are represented by formulas in conjunctive normal form. That assumption is appropriate for the classical applications of Boolean approximation but potentially limits wider use. We revisit, in a lattice-theoretic setting, so-called envelopes and cores in propositional logic, identifying them with upper and lower closure operators, respectively. This leads to recursive representation-independent characterisations of Boolean approximation for a large class of classes. We show that Boolean development can be applied in a representation-independent setting to develop approximation algorithms for a broad range of Boolean classes, including Horn and Krom functions.