Automatic combinability of rewriting-based satisfiability procedures

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

Volumn 4246 LNAI, Issue , 2006, Pages 542-556

  Kirchner, Hélène ^a   Ranise, Silvio ^a,b   Ringeissen, Christophe ^a   Tran, Duc Khanh ^a  

^a LORIA   (France)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; PROBLEM SOLVING;

META SATURATION; NELSON-OPPEN COMBINATION; REWRITING-BASED SATISFIABILITY;

COMPUTATION THEORY;

EID: 33845187876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_37     Document Type: Conference Paper

References (12)

1. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal. In Proc. of the 5th Int. Workshop on Frontiers of Combining Systems (FroCoS'05), volume 3717 of LNCS, pages 65-80. Springer, 2005.
2. A. Armando, M. P. Bonacina, S. Ranise, and S. Schulz. New results on rewrite-based satisfiability procedures, 2006. Extended version of [1], available at http://arxiv.org/abs/cs.AI/0604054.
3. A. Armando, S. Ranise, and M. Rusinowitch. A Rewriting Approach to Satisfiability Procedures. Info. and Comp., 183(2):140-164, June 2003..
4. M. P. Bonacina, S. Ghilardi, E. Nicolini, S. Ranise, and D. Zucchelli. Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures. In Proc. of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of LNAI, pages 513-527. Springer, 2006.
5. N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244-320. Elsevier Science Publishers B. V. (North-Holland), 1990.
6. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A Theorem Prover for Program Checking. Technical Report HPL-2003-148, HP Laboratories, 2003.
7. H. Kirchner, S. Ranise, C. Ringeissen, and D.-K. Tran. On superposition-based satisfiability procedures and their combination. In Second International Colloquium on Theoretical Aspects of Computing - ICTAC 2005, Hanoi, Vietnam, volume 3722 of LNCS, pages 594-608. Springer, Oct 2005.
8. C. Lynch and B. Morawska. Automatic decidability. In Proc. of the IEEE Symposium on Logic in Computer Science, July 2002.
9. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, Oct. 1979.
10. R. Nieuwenhuis and A. Rubio. Paramodulation-based theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 7, pages 371-443. Elsevier Science, 2001.
11. A. Riazanov and A. Voronkov. Splitting without backtracking. In Seventeenth International Joint Conference on Artificial Intelligence, pages 611-617, 2001.
12. D. van Dalen. Logic and Structure. Springer-Verlag, 1989. Second edition.