Dissolution: making paths vanish
Journal of the ACM (JACM)
Decomposable negation normal form
Journal of the ACM (JACM)
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Applying SAT Methods in Unbounded Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Literal Projection for First-Order Logic
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Automated Deduction for Projection Elimination - Imprint: Akademische Verlagsgesellschaft - Volume 324 Dissertations in Artificial Intelligence
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Projection and scope-determined circumscription
Journal of Symbolic Computation
SAT-Based analysis and quantification of information flow in programs
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. On the basis of a unified view on projection computation and knowledge compilation, we develop a framework for applying tableau methods to these tasks. It takes refinements from performance oriented systems into account. Formula simplifications are incorporated at the level of tableau structure modification, and at the level of simplifying encountered subformulas that are not yet fully compiled. In particular, such simplifications can involve projection computation, where this is possible with low cost. We represent tableau construction by means of rewrite rules on formulas, extended with some auxiliary functors, which is particularly convenient for formula transformation tasks. As instantiations of the framework, we discuss approaches to propositional knowledge compilation from the literature, including adaptions of DPLL, and the hyper tableau calculus for first-order clauses.