Skip to main content
Conference Proceedings

LCF-style propositional simplification with BDDs and SAT solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5170 LNCS 55-70
DOI: 10.1007/978-3-540-71067-7_9
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We improve, in both a logical and a practical sense, the simplification of the propositional structure of terms in interactive theorem provers. The method uses Binary Decision Diagrams (BDDs) and SAT solvers. We present experimental results to show that the time cost is acceptable. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Amjad, H. (2008). LCF-style propositional simplification with BDDs and SAT solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5170 LNCS, pp. 55–70). Springer Verlag. https://doi.org/10.1007/978-3-540-71067-7_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free