Combinations of theories for decidable fragments of first-order logic

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

Volumn 5749 LNAI, Issue , 2009, Pages 263-278

  Fontaine, Pascal ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BITVECTORS; CARDINALITIES; DECIDABLE THEORY; DECISION PROCEDURE; FINITE SET; FIRST ORDER LOGIC; FIRST-ORDER LOGIC WITH EQUALITY; FIRST-ORDER THEORIES; INFINITE THEORIES; LITERALS; PRACTICAL IMPORTANCE; RAMSEY THEORY; RESEARCH SUBJECTS; SATISFIABILITY MODULO THEORIES; UNINTERPRETED FUNCTIONS; VARIABLE FRAGMENT;

COMPUTABILITY AND DECIDABILITY; DATA STRUCTURES; SET THEORY;

DECISION THEORY;

EID: 76649089620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04222-5_16     Document Type: Conference Paper

References (24)

1. Abrial, J.-R.: The B-Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)
2. Baaz, M., Egly, U., Leitsch, A.: Normal form transformations. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 5, vol. I, pp. 273-333. Elsevier Science B.V, Amsterdam (2001)
3. Baumgartner, P., Fuchs, A., Tinelli, C.: Implementing the Model Evolution Calculus. In: Schulz, S., Sutcliffe, G., Tammet, T. (eds.) Special Issue of the International Journal of Artificial Intelligence Tools (IJAIT). International Journal of Artificial Intelligence Tools, vol. 15 (2005)
4. Bernays, P., Schönfinkel, M.: Zum Entscheidungsproblem der mathematischen Logik. Math. Annalen 99, 342-372 (1928)
5. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, Berlin (1997)
6. Dreben, B., Goldfarb, W.D.: The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley, Reading (1979)
7. Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995)
8. Enderton, H.B.: A Mathematical Introduction to Logic, Orlando, Florida. Academic Press Inc., London (1972)
9. Fontaine, P.: Combinations of theories and the Bernays-Schönfinkel- Ramsey class. In: Beckert, B. (ed.) 4th International Verification Workshop - VERIFY 2007, Bremen (15/07/07-16/07/07) (July 2007)
10. Fontaine, P.: Combinations of theories for decidable fragments of first-order logic (2009), http://www.loria.fr/~fontaine/Fontaine12b.pdf
11. Fontaine, P., Gribomont, E.P.: Decidability of invariant validation for parameterized systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 97-112. Springer, Heidelberg (2003)
12. Fontaine, P., Gribomont, E.P.: Combining non-stably infinite, non-first order theories. In: Ahrendt, W., Baumgartner, P., de Nivelle, H., Ranise, S., Tinelli, C. (eds.) Selected Papers from the Workshops on Disproving and the Second International Workshop on Pragmatics of Decision Procedures (PDPAR 2004), July 2005. Electronic Notes in Theoretical Computer Science, vol. 125, pp. 37-51 (2005)
13. Grädel, E., Kolaitis, P.G., Vardi, M.Y.: On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic 3(1), 53-69 (1997)
14. Gurevich, Y., Shelah, S.: Spectra of monadic second-order formulas with one unary function. In: LICS 2003: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, pp. 291-300. IEEE Computer Society, Washington (2003)
15. Lamport, L.: Specifying Systems. Addison-Wesley, Boston (2002)
16. Nelson, G., Oppen, D.C.: Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245-257 (1979)
17. Ramsey, F.P.: On a Problem of Formal Logic. Proceedings of the London Mathematical Society 30, 264-286 (1930)
18. Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Communications 15(2), 91-110 (2002)
19. Schulz, S.: System Abstract: E 0.61. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 370-375. Springer, Heidelberg (2001)
20. Sutcliffe, G., Suttner, C.: The State of CASC. AI Communications 19(1), 35-48 (2006)
21. Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems (FroCoS), Applied Logic, pp. 103-120. Kluwer Academic Publishers, Dordrecht (1996)
22. Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science 290(1), 291-353 (2003)
23. Tinelli, C., Zarba, C.G.: Combining non-stably infinite theories. Journal of Automated Reasoning 34(3), 209-238 (2005)
24. Wies, T., Piskac, R., Kuncak, V.: Combining theories with shared set operations. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS (LNAI), vol. 5749, pp. 366-382. Springer, Heidelberg (2009)