Generalizing DPLL and satisfiability for equalities

Information and Computation

Volumn 205, Issue 8, 2007, Pages 1188-1211

  Badban, Bahareh ^d   Van De Pol, Jaco ^a,b   Tveretina, Olga ^c   Zantema, Hans ^b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^d UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Decision procedure; DPLL procedure; Equality; Ground term algebra; Inductive datatypes; Satisfiability

Indexed keywords

ALGEBRA; COMPUTER CIRCUITS;

DECISION PROCEDURE; DPLL PROCEDURE; EQUALITY; GROUND TERM ALGEBRAS; INDUCTIVE DATATYPES; SATISFIABILITY;

FORMAL LOGIC;

EID: 84855205860     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.03.003     Document Type: Article

References (35)

1. W. Ackermann, Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics, North Holland, Amsterdam, 1954.
2. A. Armando, C. Castellini, E. Giunchiglia, F. Giunchiglia, A. Tacchella, SAT-based decision procedures for automated reasoning: a unifying perspective, IRST Technical Report 0202-05, Istituto Trentino di Cultura, February 2002.
3. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, R. A. Sebastiani, SAT based approach for solving formulas over boolean and linear mathematical propositions, in: A. Voronkov (Ed.), Automated Deduction-CADE-18:18th International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 2393, Springer-Verlag, 2002, pp. 195-210.
4. F. Baader, T. Nipkow, Term Rewriting and All That, Cambridge University Press, New York, 1998.
5. B. Badban, Verification Techniques for Extensions of Equality Logic, Ph. D. Thesis, Free University, Amsterdam, 2006.
6. B. Badban, J. van de Pol, O. Tveretina, H. Zantema, Solving satisfiability of ground term algebras using DPLL and unification, in: Workshop on Unification, Cork, Ireland, July 2004.
7. B. Badban, J. van de Pol, Zero, successor and equality in binary decision diagrams, Annals of Pure and Applied Logic 133 (1-3) (2005) 101-123.
8. C. Barrett, D. Dill, A. Stump, Aframework for cooperating decision procedures, in: D. A. McAllester (Ed.), Proceedings of the 17th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1831, Springer, Pittsburgh, PA, 2000, pp. 79-98.
9. P. Baumgartner, FDPLL-a First-Order Davis-Putnam-Logeman-Loveland Procedure, in: D. McAllester (Ed.), Proceedings of the 17th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 1831, Springer-Verlag, 2000, pp. 200-219.
10. S. Blom, W. Fokkink, J. Groote, I. van Langevelde, B. Lisser, J. van de Pol, μCRL: a toolset for analysing algebraic specifications, in: G. Berry, H. Comon, A. Finkel (Eds.), Proceedings of the 13th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 2102, Springer-Verlag, 2001, pp. 250-254. (Pubitemid 33312921)
11. M. Brand, H.d. Jong, P. Klint, P. Olivier, Efficient annotated terms, Software-Practice & Experience 30(2000) 259-291. (Pubitemid 30577811)
12. R. Bryant, S. German, M. Velev, Exploiting positive equality in a logic of equality with uninterpreted functions, in: N. Halbwachs, D. Peled (Eds.), Proceedings of the 11th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 1633, Springer-Verlag, 1999, pp. 470-482.
13. A. Colmerauer, Equations and inequations on finite and infinite trees, in: I. Staff (Ed.), Proceedings of the Conference on Fifth Generation Computer Systems, North Holland, 1984, pp. 85-99. (Pubitemid 16622952)
14. H. Comon, P. Lescanne, Equational problems and disunification, Journal of Symbolic Computation 7 (3-4) (1989) 371-425.
15. M. Davis, G. Logemann, D. Loveland, Amachine program for theorem proving, Communications of the ACM 5(7) (1962) 394-397.
16. M. Davis, H. Putnam, Acomputing procedure for quantification theory, Journal of the Association for Computing Machinery 7(3) (1960) 201-215.
17. J.-C. Filliâtre, S. Owre, H. Ruess, N. Shankar, ICS: integrated canonizer and solver, in: G. Berry, H. Comon, A. Finkel (Eds.), Proceedings of the 13th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 2102, Springer-Verlag, 2001, pp. 246-249. (Pubitemid 33312920)
18. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, C. Tinelli, DPLL (T): fast decision procedures, in: R. Alur, D. Peled (Eds.), Proceedings of the 16th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 3114, 2004, pp. 175-188.
19. F. Giunchiglia, R. Sebastiani, Building decision procedures for modal logics from propositional decision procedures: the case study of modal K, in: M. A. McRobbie J. K. Slaney (Eds.), Proceedings of the 13th International Conference on Automated Deduction (CADE-96), Lecture Notes in Artificial Intelligence, vol. 1104, Springer-Verlag, 1996, pp. 583-597. (Pubitemid 126101577)
20. A. Goel, K. Sajid, H. Zhou, A. Aziz, BDD based procedures for a theory of equality with uninterpreted functions, in: A. J. Hu, M. Vardi (Eds.), Proceedings of the 10th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 1427, Springer-Verlag, 1998, pp. 244-255. (Pubitemid 128092343)
21. J. Groote, M. Reniers, Algebraic process verification, in: J. Bergstra, A. Ponse, S. Smolka (Eds.), Handbook of Process Algebra, Elsevier, NewYork, 2001, ch. 17.
22. J. Groote, J. van de Pol, Equational binary decision diagrams, in: M. Parigot, A. Voronkov (Eds.), Proceedings of the 7th Conference on Logic for Programming and Automated Reasoning, Lecture Notes in Artificial Intelligence, vol. 1955, Springer-Verlag, 2000, pp. 161-178.
23. G. Huet, Résolution d'équations dans les languages d'ordre 1, 2,..., ω, Ph. D. Thesis, Université Paris 7, 1976.
24. J. R. Burch, D. L. Dill, Automatic verification of pipelined microprocessors control, in: D. L. Dill (Ed.), Proceedings of the 6th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 818, Springer-Verlag, 1994, pp. 68-80.
25. J.-L. Lassez, M. J. Maher, K. Marriott, Unification revisited, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Los Altos, CA, 1987, pp. 587-625.
26. M. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees, in: Proceedings of the 3rd Annual Symposium on Logic in Computer Science, IEEE Computer Society, 1988, pp. 348-357.
27. R. Nieuwenhuis, A. Oliveras, Congruence closure with integer offsets, in: MY. Vardi, A. Voronkov (Eds.), Proceedings of the 10th International Conference on Logics for Programming AI and Reasoning (LPAR), Lecture Notes in Artificial Intelligence, vol. 2850, Springer-Verlag, 2003, pp. 78-90. (Pubitemid 37231441)
28. R. Pichler, On the complexity of equational problems in CNF, Journal of Symbolic Computation 36(2003) 235-269. (Pubitemid 36836842)
29. A. Pnueli, Y. Rodeh, O. Shtrichman, M. Siegel, Deciding equality formulas by small domains instantiations, in: N. Halbwachs, D. Peled (Eds.), Proceedings of the 11th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 1633, Springer-Verlag, 1999, pp. 455-469.
30. J. Robinson, Amachine-oriented logic based on the resolution principle, Journal of the ACM 12(1) (1965) 23-49.
31. N. Shankar, H. Ruess, Combining Shostak theories, in: S. Tison (Ed.), Proceedings of the 13th Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 2378, Springer-Verlag, 2002, pp. 1-18.
32. A. Stump, C. Barrett, D. Dill, CVC: a cooperating validity checker, in: J. Godskesen (Ed.), Proceedings of the 14th Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 2404, Springer-Verlag, 2002, pp. 500-505.
33. O. Tveretina, Adecision procedure for equality logic with uninterpreted functions, in: B. Buchberger, J. A. Campbell (Eds.), Artificial Intelligence and Symbolic Mathematical Computation, Lecture Notes in Artificial Intelligence, vol. 3249, Springer-Verlag, 2004, pp. 63-76.
34. O. Tveretina, Decision Procedures for Equality Logic with Uninterpreted Functions, Ph. D. Thesis, Technical University of Eindhoven, 2005.
35. H. Zantema, J. F. Groote, Transforming equality logic to propositional logic, in Proceedings of the 4th International Workshop on First-Order Theorem Proving (FTP'03), Electronic Notes in Theoretical Computer Science, 86(1) (2003) 1-12.