Binary decision diagrams for first-order predicate logic

Journal of Logic and Algebraic Programming

Volumn 57, Issue 1-2, 2003, Pages 1-22

  Groote, Jan Friso ^a   Tveretina, Olga ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Automatic reasoning; Binary decision diagrams; First order predicate logic

Indexed keywords

ALGORITHMS; FORMAL LOGIC; PROBLEM SOLVING;

AUTOMATIC REASONING;

DATA STRUCTURES;

EID: 0042029576     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(03)00039-0     Document Type: Article

References (18)

1. K.S. Brace, R.L. Rudell, R.E. Bryant. Efficient implementation of a BDD package. 27th ACM IEEE Design Automation Conference 1990, pp. 40-45.
2. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp. C-35(8):1986;677-691.
3. 20 states and beyond. Inform. Comput. 98(2):1992;142-170.
4. Dershowitz N. Termination of rewriting. J. Symbol. Comput. 3(1):1987;69-116.
5. J. Goubault, Syntax independent connections, in: D. Basin, B. Fronhöfer, R. Hähnle, J. Posegga, C. Schwind (Eds.), Proceedings of the 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 1993.
6. J. Goubault, Proving with BDDs and control of information, unpublished manuscript, 1995.
7. J.F. Groote, H. Zantema, Resolution and binary decision diagrams cannot simulate each other polynomially, Technical Report UU-CS-2000-14, Department of Computer Science, Utrecht University, 2000.
8. Klop J.W. Term rewriting systems. Abramsky S., Gabbay D.M., Maibaum T.S.E. Handbook of Logic in Computer Science. vol. 2:1992;1-116 Oxford Science Publications.
9. K.L. McMillan, J. Schwalbe, Formal verification of the Gigamax cache consistency protocol, in: International Symposium on Shared Memory Multiprocessing, 1991.
10. Martelli A., Montanari U. An efficient unification algorithm. ACM Trans. Prog. Lang. Syst. 4(2):1982;258-282.
11. Paterson M.S., Wegman M.N. Linear unification. J. Comp. Syst. Sci. 16:1978;158-167.
12. Pelletier F.J. Seventy-five problems for testing automated theorem provers. J. Automat. Reason. 2:1986;191-216. See also Errata Journal of Automated Reasoning. 4:1988;235-236.
13. Pelletier F.J. Seventy-five problems for testing automated theorem provers. J. Automat. Reason. 2:1986;191-216. See also Errata Journal of Automated Reasoning. 4:1988;235-236.
14. J. Possega, B. Ludäscher, Towards first-order deduction based on Shannon graphs, in: Proceedings of 16th German Conference on AI(GWAI-92), volume 671 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1992, pp. 67-76.
15. Posegga J., Schmitt P.H. Automated deduction with shannon graphs. J. Logic Comput. 5(6):1995;697-729.
16. J. Posegga, K. Schneider, Deduction with first-order BDDs, in: D. Basin, Bertram Fronhöfer, Reiner Hähnle, J. Posegga, C. Schwind (Eds.), Proceedings of the 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 1993.
17. J. Posegga, SHAnnon graph REfutation system. This is an implementation of a BDD based theorem prover. Information: posegga@ira.uka.de , 1995.
18. Urquhart A. Hard examples for resolution. J. Assoc. Comp. Machine. 24(1):1987;209-219.