Combinations of theories and the bernays-schönfinkel-ramsey class

CEUR Workshop Proceedings

Volumn 259, Issue , 2007, Pages 37-54

  Fontaine, Pascal ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; DECIDABLE THEORY; DECISION PROCEDURE; FUNCTION SYMBOLS; GLOBAL MODELING; PRENEX NORMAL FORMS; SMT SOLVERS;

DECISION THEORY;

EID: 84872688316     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Yices: An SMT solver. Available on http://yices.csl.sri.com/.
2. J.-R. Abrial. The B-Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
3. M. Baaz, U. Egly, and A. Leitsch. Normal form transformations. In J. A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 5, pages 273-333. Elsevier Science B.V., 2001.
4. P. Baumgartner, A. Fuchs, and C. Tinelli. Implementing the Model Evolution Calculus. In S. Schulz, G. Sutcliffe, and T. Tammet, editors, Special Issue of the International Journal of Artificial Intelligence Tools (IJAIT), Volume 15 of International Journal of Artificial Intelligence Tools, 2005.
5. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, Inc., Orlando, Florida, 1972.
6. P. Fontaine. Techniques for verification of concurrent systems with invariants. PhD thesis, Institut Montefiore, Université de Liège, Belgium, Sept. 2004.
7. P. Fontaine and E. P. Gribomont. Combining non-stably infinite, non-first order theories. In W. Ahrendt, P. Baumgartner, H. de Nivelle, S. Ranise, and C. Tinelli, editors, Selected Papers from the Workshops on Disproving and the Second International Workshop on Pragmatics of Decision Procedures (PDPAR 2004), Volume 125 of Electronic Notes in Theoretical Computer Science, pages 37-51, July 2005.
8. P. Fontaine, J.-Y. Marion, S. Merz, L. P. Nieto, and A. Tiu. Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In Tools and Algorithms for Construction and Analysis of Systems (TACAS), Volume 3920 of Lecture Notes in Computer Science, pages 167-181. Springer-Verlag, 2006.
9. L. Lamport. Specifying Systems. Addison-Wesley, Boston, Mass., 2002.
10. S. McLaughlin, C. Barrett, and Y. Ge. Cooperating theorem provers: A case study combining HOL-light and CVC lite. Electronic Notes in Theoretical Computer Science, 144(2):43-51, 2006.
11. G. Nelson and D. C. Oppen. Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, Oct. 1979.
12. R. Nieuwenhuis and A. Oliveras. Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools. (Invited Paper). In G. Sutcliffe and A. Voronkov, editors, 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'05, Volume 3835 of Lecture Notes in Computer Science, pages 23-46. Springer, 2005.
13. A. Riazanov and A. Voronkov. The design and implementation of Vampire. AI Communications, 15(2):91-110, 2002.
14. S. Schulz. System Abstract: E 0.61. In R. Goré, A. Leitsch, and T. Nipkow, editors, International Joint Conference on Automated Reasoning (IJCAR), number 2083 in Lecture Notes in Artificial Intelligence, pages 370-375. Springer, 2001.
15. G. Sutcliffe and C. Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
16. C. Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-31, Jan. 2003.
17. C. Tinelli and C. G. Zarba. Combining non-stably infinite theories. In I. Dahn and L. Vigneron, editors, First Order Theorem Proving, Volume 86.1 of Electronic Notes in Theoretical Computer Science. Elsevier, 2003.