Combining decision procedures for sorted theories

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 641-653

  Tinelli, Cesare ^a   Zarba, Calogero G ^b  

^a University of Iowa   (United States)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SET THEORY;

DECISION PROCEDURE; FIRST ORDER LOGIC; NELSON-OPPEN COMBINATION METHODS; NELSON-OPPEN METHOD; NON-DETERMINISM; THEORETICAL POINTS;

ARTIFICIAL INTELLIGENCE; DECISION THEORY;

DECISION PROCEDURES; FIRST-ORDER LOGIC; NELSON-OPPEN METHOD; QUANTIFIERS;

EID: 15544383770     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_53     Document Type: Conference Paper

References (15)

1. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2-3-148, HP Laboratories, Palo Alto, CA, 2003.
2. V. Ganesh, S. Berezin, C. Tinelli, and D. Dill. Combination results for many sorted theories with overlapping signatures. Technical report, Department of Computer Science, Stanford University, 2004.
3. S. Ghilardi. Quantifier elimination and provers integration. In I. Dahn and L. Vigneron, editors, First Order Theorem Proving, volume 86.1 of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.
4. S. Ghilardi. Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 2004. (To appear).
5. J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2):217-173, 1992.
6. F. Maric and P. Janičić. ARGO-LIB: A generic platform for decision procedures. In International Joint Conference on Automated Reasoning, Lecture Notes in Computer Science. Springer, 2004.
7. J. Meseguer. Membership algebra as a logical framework for equational specification. In Recent Trends in Algebraic Development Techniques, volume 1376 of Lecture Notes in Computer Science, pages 18-61. Springer, 1998.
8. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
9. A. Stump, C. W. Barrett, and D. L. Dill. CVC: A cooperating validity checker. In E. Brinksma and K. G. Larsen, editors, Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, pages 500-504, 2002.
10. C. Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-31, 2003.
11. C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In F. Baader and K. U. Schulz, editors, Frontiers of Combining Systems, volume 3 of Applied Logic Series, pages 103-120. Kluwer, 1996.
12. C. Tinelli and C. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290(1):291-353, 2003.
13. C. Tinelli and C. G. Zarba. Combining decision procedures for sorted theories. Technical Report 04-01, The University of Iowa, 2004.
14. C. G. Zarba. C-tableaux. Technical Report RR-5229, INRIA, 2004.
15. C. G. Zarba. The Combination Problem in Automated Reasoning. PhD thesis, Stanford University, 2004.