Abstract
BDDs (binary decision diagrams) are a very successful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists. We give an overview of BDDs from an automated deduction perspective, showing what can be done with them in prepositional and first-order logic, and discuss the parallels to well-known methods like tableaux and resolution.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.B. Andrews. Theorem proving via general matings. J. ACM, 28(2), 1981.
W. Bibel. Automated Theorem Proving. Vieweg, 1987.
G. Boole. An investigation of the laws of thought, on which are founded the mathematical theories of logic and probabilities. Dover, NY, 1958. (1st Edition 1854).
K.S. Brace, et. al. Efficient implementation of a BDD package. In 27th DAC, 1990.
R.Y. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, C-35, 1986.
R.Y. Bryant. Symbolic boolean manipulation with ordered BDDs. Tech. rep., CMU, 1992.
J.R. Burch, et. al. Symbolic model checking: 1020 states and beyond. In 5th LICS, 1990.
C.-L. Chang and R.C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Computer Science Classics. Academic Press, 1973.
A. Church. Introduction to Mathematical Logic, vol. 1. Princeton Univ. Press, 1956.
O. Coudert. SIAM: Une BoÎte à Outils Pour la Preuve Formelle de Systèmes Séquentiels. PhD thesis, ENST, Paris, Oct. 1991.
M. d'Agostino. Are tableaux an improvement on truth-tables? J. Logic, Language and Information, 1(3), 1992.
E.A. Emerson. Temporal and Modal Logic, chapter 16. Elsevier, 1990.
M.C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, 1990.
M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, 1979.
J. Goubault. Syntax independent connections. In D. Basin et al., editera, 2nd Tableaux Workshop, number MPI-I-93-213. Max Planck Institut für Informatik, 1993.
J. Goubault. Proving with BDDs and control of information. In CADE-12, 1994.
R. Kowalski and D. Kuehner. Linear resolution with selection function. AI, 2, 1971.
J.C. Madre and O. Coudert. A logically complete reasoning maintenance system based on a logical constraint solver. In 12th IJCAI, 1991.
K.L. McMillan. Symbolic Model Checking: an Approach to the State Explosion Problem. PhD thesis, CMU, 1992.
J. Posegga. Deduktion mit Shannongraphen für Prädikatenlogik erster Stufe. Infix-Verlag, FRG, 1993.
J. Posegga and P. H. Schmitt Automated deduction with Shannon graphs. submitted, 1994.
Joachim Posegga. Compiling proof search in semantic tableaux. In 7 th ISMIS, LNAI, Trondheim, Norway, 1993. Springer.
J.A. Robinson. A machine-oriented logic based on the resolution principle. JACM, 12(1), 1965.
C.E. Shannon. A symbolic analysis of relay and switching circuits. AIEE Trans., 67, 1938.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goubault, J., Posegga, J. (1994). BDDs and automated deduction. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_54
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive