A Decision Procedure for Equality Logic with Uninterpreted Functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3249, Issue , 2004, Pages 66-79

  Tveretina, Olga ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Dpll procedure; Equality logic with uninterpreted functions; Satisfiability

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; FORMAL LOGIC; HEURISTIC METHODS; RECONFIGURABLE HARDWARE;

DECISION PROCEDURE; DPLL PROCEDURE; EFFICIENT IMPLEMENTATION; EQUALITY LOGIC WITH UNINTERPRETED FUNCTIONS; PRE-PROCESSING STEP; SATISFIABILITY; SATISFIABILITY CHECKER;

COMPUTER CIRCUITS;

EID: 26844437239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_7     Document Type: Article

References (12)

1. ACKERMANN, W. Solvable cases of the decision problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
2. BARRETT, C. W., DILL, D., AND LEVITT, J. Validity checking for combinations of theories with equality. In Formal Methods in Computer-Aided Design (FMCAD'96) (November 1996), M. Srivas and A. Camilleri, Eds., vol. 1166 of LNCS, SpringerVerlag, pp. 187-201.
3. BRYANT, R., AND VELEV, M. Boolean satisfiability with transitivity constraints. ACM Transactions on Computational Logic 3,4 (October 2002), 604-627.
4. DURCH, J-, AND DILL, D. Automated verification of pipelined microproccsoor control. In Computer-Aided Verification (CAV'94) (June 1994), D. Dill, Ed., vol. 818 of LNCS, Springer-Verlag, pp. 68-80.
5. DAVIS, M., LOGEMANN, G., AND LoVELAND, D. A machine program for theorem proving. Communications of the Association for Computing Machinery 7 (July 1962), 394-397.
6. GOEL, A-, SAJID, K., ZHOU, H., Aziz, A., AND SINGHAL, V. BDD based procedures for a theory of equality with uninterpreted functions. In Computer-Aided Verification (CAV'98) (1998), A. J. Hu and M. Y. Vardi, Eds., vol. 1427 of LNCS, Springer-Verlag, pp. 244-255.
7. GROOTE, J., AND VAN DE POL, J. Equational binary decision diagrams. In Logic for Programming and Reasoning (LPAR'2000) (2000), M. Parigot and A. Voronkov, Eds., vol. 1955 of LNAI, pp. 161-178.
8. NIEUWENHUIS, R., AND OLIVERAS, A. Congruence closure with integer offsets. In 10h Int. Conf. Logic for Programming, Artif. Intell. and Reasoning (LPAR) (2003), M. Vardi and A. Voronkov, Eds., LNAI 2850, pp. 78-90.
9. PNUELI, A., RODEII, Y., SHTRICHMAN, O., AND SIEGEL, M. Deciding equality formulas by small domains instantiations. In Computer Aided Verification (CAV'99) (1999), vol. 1633 of LNCS, Springer-Verlag, pp. 455-469.
10. RODEH, Y., AND SHTRICHMAN, O. Finite instantiations in equivalence logic with uninterpreted functions. In Computer Aided Verification (CAV'Ol) (July 2001), vol. 2102 of LNCS, Springer-Verlag, pp. 144-154.
11. SHOSTAK, R. An algorithm for reasoning about equality. Communications of the ACM 21 (1978).
12. TSEITIN, G. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2. Consultant Bureau, New York-London, 1968, pp. 115-125.