A Proof System and a Decision Procedure for Equality Logic
Equality Logic with uninterpreted functions is used for proving the equivalense or refinement between systems (hardware verification, compiler translation, etc). Current approaches for deciding this type of formulas use a transformation of an equality formula to the propositional one of larger size, and then any standard SAT checker can be applied. We give an approach for deciding satisfiability of equality logic formulas (E-SAT) in conjunctive normal form. Central in our approach is a single proof rule called ER. For this single rule we prove soundness and completeness. Based on this rule we propose a complete procedure for E-SAT and prove its correctness. Applying our procedure on a variation of the pigeon hole formula yields a polynomial complexity contrary to earlier approaches to E-SAT.
KeywordsEquality logic satisfiability resolution
Unable to display preview. Download preview PDF.
- 5.Burch, J., Dill, D.: Automated verification of pipelined microprocesoor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 68–80. Springer, Heidelberg (1994)Google Scholar
- 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, pp. 115–125 (1968)Google Scholar
- 13.Tveretina, O., Zantema, H.: A proof system and a decision procedure for equality logic. Tech. rep. (2003), http://www.tue.nl/bib/indexen.html
- 14.Zantema, H., Groote, J.F.: Transforming equality logic to propositional logic. In: Proceedings of 4th International Workshop on First-Order Theorem Proving (FTP 2003). Electronic Notes in Theoretical Computer Science, vol. 86 (2003)Google Scholar