Connecting many-sorted theories

Journal of Symbolic Logic

Volumn 72, Issue 2, 2007, Pages 535-583

  Baader, Franz ^a   Ghilardi, Silvio ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34249724378     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1185803623     Document Type: Article

References (34)

1. FARID AJILI and CLAUDE KIRCHNER, A modular framework for the combination of symbolic and built-in constraints, Proceedings of the Fourteenth International Conference on Logic Programming (Leuven, Belgium) (Lee Naish, editor), The MIT press, 1997, pp. 331-345.
2. FRANZ BAADER and SILVIO GHILARDI, Connecting many-sorted structures and theories through adjoint functions. Proceedings of the 5th International Workshop on Frontiers of Combining Systems (FroCoS 2005) (Vienna, Austria) (B. Gramlich, editor). Lecture Notes in Artificial Intelligence, vol. 3717, Springer-Verlag, 2005, pp. 31-47.
3. _, Connecting many-sorted theories. Proceedings of the 20th International Conference on Automated Deduction (CADE-05) (Tallinn (Estonia)), Lecture Notes in Artificial Intelligence, vol. 3632, Springer-Verlag, 2005, pp. 278-294.
4. FRANZ BAADER, SILVIO GHILARDI, and CESARE TINELLI, A new combination procedure for the word problem that generalizes fusion decidability results in modal logics, Proceedings of the Second International Joint Conference on Automated Reasoning (IJCAR'04) (Cork, Ireland), Lecture Notes in Artificial Intelligence, vol. 3097, Springer-Verlag, 2004, pp. 183-197.
5. _, A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Information and Computation, vol. 204 (2006), no. 10, pp. 1413-1452.
6. FRANZ BAADER, CARSTEN LUTZ, HOLGER STURM, and FRANK WOLTER. Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research, vol. 16 (2002), pp. 1-58.
7. FRANZ BAADER and CESARE TINELLI. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia) (William McCune, editor), Lecture Notes in Artificial Intelligence, vol. 1249, Springer-Verlag, 1997, pp. 19-33.
8. _, Deciding the word problem in the union of equational theories. Information and Computation, vol. 178 (2002), no. 2, pp. 346-390.
9. PATRICK BLACKBURN, MAARTEN DE RIJKE, and YDE VENEMA, Modal logic, Cambridge Tracts in Theoretical Computer Science, vol. 53, Cambridge University Press, 2001.
10. MARIA PAOLA BONACINA, SILVIO GHILARDI. ENRICA NICOLINI, SILVIO RANISE, and DANIELE ZUCCHELLI, Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures. Proceedings of the Third International Joint Conference on Automated Reasoning (U. Furbach and N. Shankar, editors), Lecture Notes in Artificial Intelligence, vol. 4130, Springer-Verlag, 2006, pp. 513-527.
11. CHEN-CHUNG CHANG and H. JEROME KEISLER, Model theory. IIIrd ed., North-Holland, 1990.
12. ERIC DOMENJOUD, FRANCIS KLAY, and CHRISTOPHE RINGEISSEN, Combination techniques far non-disjoint equational theories. Proceedings of the 12th International Conference on Automated Deduction (Nancy, France) (Alan Bundy, editor), Lecture Notes in Artificial Intelligence, vol. 814, Springer-Verlag, 1994, pp. 267-281.
13. CAMILLO FIORENTINI and SILVIO GHILARDI, Combining word problems through rewriting in categories with products, Theoretical Computer Science, vol. 294 (2003), pp. 103-149.
14. JEAN H. GALLIER, Logic for computer science: Foundations of automatic theorem proving, Harper & Row, 1986.
15. SILVIO GHILARDI, Reasoners' cooperation and quantifier elimination, Technical Report 288-03, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, 2003, Available on-line at http://homes.dsi.unimi.it/~ghilardi/allegati/eqfin.ps.
16. _, Model-theoretic methods in combined constraint satisfiability, Journal of Automated Reasoning, vol. 33 (2005), no. 3-4, pp. 221-249.
17. SILVIO GHILARDI and MAREK ZAWADOWSKI, Sheaves, games and model completions. Trends in Logic, vol. 14, Kluwer Academic Publishers, 2002.
18. WILFRID HODGES, Model theory. Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge University Press, Cambridge, 1993.
19. MARCUS KRACHT and FRANK WOLTER, Properties of independently axiomatizable bimodal logics, this JOURNAL, vol. 56 (1991), no. 4, pp. 1469-1485.
20. OLIVER KUTZ, CARSTEN LUTZ, FRANK WOLTER, and MICHAEL ZAKHARYASCHEV, Connections of abstract description systems, Artificial Intelligence, vol. 156 (2004), pp. 1-73.
21. MICHAEL MAKKAI and GONZALO E. REYES, First-order categorical logic, Lecture Notes in Mathematics, vol. 611, Springer-Verlag, 1977.
22. GREG NELSON, Combining satisfiability procedures by equality-sharing, Automated theorem proving: After 25 years (W. W. Bledsoe and D. W. Loveland, editors), Contemporary Mathematics, vol. 29, American Mathematical Society, Providence, RI, 1984, pp. 201-211.
23. GREG NELSON and DEREK C. OPPEN, Simplification by cooperating decision procedures, ACM Transactions on Programming Languages and Systems, vol. 1 (1979), no. 2, pp. 245-257.
24. TOBIAS NIPKOW, Combining matching algorithms: The regular case, Journal of Symbolic Computation, vol. 12 (1991), pp. 633-653.
25. DEREK C. OPPEN, Complexity, convexity and combinations of theories, Theoretical Computer Science, vol. 12 (1980), pp. 291-302.
26. DON PIGOZZI, The join of equational theories, Colloquium Mathematicum, vol. 30 (1974), no. 1, pp. 15-25.
27. MOJZESZ PRESBURGER, Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes rendus du congrès de mathématiciens des pays slaves (Warsaw, Poland), 1929.
28. MANFRED SCHMIDT-SCHAUß, Unification in a combination of arbitrary disjoint equational theories, Journal of Symbolic Computation, vol. 8 (1989), no. 1-2, pp. 51-100, Special issue on unification. Part II.
29. EDITH SPAAN, Complexity of modal logics, Ph.D. thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1993.
30. CESARE TINELLI, Cooperation of background reasoners in theory reasoning by residue sharing, Journal of Automated Reasoning, vol. 30 (2003), no. 1, pp. 1-31.
31. CESARE TINELLI and CHRISTOPHE RINGEISSEN, Unions of non-disjoint theories and combinations of satisfiability procedures, Theoretical Computer Science, vol. 290 (2003), no. 1, pp. 291-353.
32. FRANK WOLTER, Fusions of modal logics revisited. Advances in modal logic (M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors), CSLI, Stanford, CA, 1998, pp. 361-379.
33. CALOGERO ZARBA, Combining multisets with integers, Proceedings of the 18th International Conference on Automated Deduction (CADE'18) (Andrei Voronkov, editor), Lecture Notes in Artificial Intelligence, vol. 2392, Springer-Verlag, 2002, pp. 363-376.
34. MAREK W. ZAWADOWSKI, Descent and duality, Annals of Pure and Applied Logic, vol. 71 (1995), no. 2, pp. 131-188.