Generalizing DPLL and satisfiability for equalities-Reference-Cited by-同舟云学术

Generalizing DPLL and satisfiability for equalities

Published:2007-08 Issue:8 Volume:205 Page:1188-1211
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Badban Bahareh,van de Pol Jaco,Tveretina Olga,Zantema Hans

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference35 articles.

1. Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics;Ackermann,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. Term Rewriting and All That;Baader,1998

5. B. Badban, Verification Techniques for Extensions of Equality Logic, Ph.D. Thesis, Free University, Amsterdam, 2006.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deciding floating-point logic with abstract conflict driven clause learning;Formal Methods in System Design;2013-12-20

2. Abstract conflict driven learning;ACM SIGPLAN Notices;2013-01-23

3. An Abstract Interpretation of DPLL(T);Lecture Notes in Computer Science;2013

4. EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas;Electronic Notes in Theoretical Computer Science;2009-01