Connecting many-sorted theories

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

Volumn 3632 LNAI, Issue , 2005, Pages 278-294

  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

COMPUTABILITY AND DECIDABILITY; FUNCTIONS;

DISJOINT UNION; HOMOMORPHISMS;

ARTIFICIAL INTELLIGENCE;

EID: 26944474806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_21     Document Type: Conference Paper

References (25)

1. Farid Ajili and Claude Kirchner. A modular framework for the combination of symbolic and built-in constraints. In Proceedings of Fourteenth International Conference on Logic Programming, pages 331-345, Leuven, Belgium, 1997. The MIT Press.
2. Franz Baader and Silvio Ghilardi. Connecting many-sorted theories. LTCS-Report LTCS-05-04, TU Dresden, Germany, 2005. See http://lat.inf.tu- dresden.de/research/reports.html.
3. Franz Baader, Silvio Ghilardi, and Cesare Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. In Proceedings of the Second International Joint Conference on Automated Reasoning (IJCAR'04), volume 3097 of Lecture Notes in Artificial Intelligence, pages 183-197, Cork (Ireland), 2004. Springer-Verlag.
4. Franz Baader, Carsten Lutz, Holger Sturm, and Frank Wolter. Fusions of description logics and abstract description systems. Journal of Artificial Intelligence Research, 16:1-58, 2002.
5. 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. In Proceedings of the the International Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Intelligence, pages 19-33, Townsville (Australia), 1997. Springer-Verlag.
6. Franz Baader and Cesare Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 178(2):346-390, 2002.
7. Chen-Chung Chang and H. Jerome Keisler. Model Theory. North-Holland, Amsterdam-London, IIIrd edition, 1990.
8. Eric Domenjoud, Francis Klay, and Christophe Ringeissen. Combination techniques for non-disjoint equational theories. In Proceedings of the 12th International Conference on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 267-281, Nancy (France), 1994. Springer-Verlag.
9. Camillo Fiorentini and Silvio Ghilardi. Combining word problems through rewriting in categories with products. Theoretical Computer Science, 294:103-149, 2003.
10. Jean H. Gallier. Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row, 1986.
11. Silvio Ghilardi. Model-theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 33(3-4):221-249, 2004.
12. Marcus Kracht and Frank Wolter. Properties of independently axiomatizable bimodal logics. The Journal of Symbolic Logic, 56(4):1469-1485, 1991.
13. Oliver Kutz, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. ε-connections of abstract description systems. Artificial Intelligence, 156:1-73, 2004.
14. Michael Makkai and Gonzalo E. Reyes. First-Order Categorical Logic, volume 611 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1977.
15. Greg Nelson. Combining satisfiability procedures by equality-sharing. In W. W. Bledsoe and D. W. Loveland, editors, Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics, pages 201-211. American Mathematical Society, Providence, RI, 1984.
16. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, October 1979.
17. Tobias Nipkow. Combining matching algorithms: The regular case. Journal of Symbolic Computation, 12:633-653, 1991.
18. Derek C. Oppen. Complexity, convexity and combinations of theories. Theoretical Computer Science, 12:291-302, 1980.
19. Don Pigozzi. The join of equational theories. Colloquium Mathematicum, 30(1):15-25, 1974.
20. Edith Spaan. Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1993.
21. Cesare Tinelli. Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning, 30(1):1-31, January 2003.
22. Cesare Tinelli and Christophe Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290 (1):291-353, January 2003.
23. Frank Wolter. Fusions of modal logics revisited. In Advances in Modal Logic. CSLI, Stanford, CA, 1998.
24. Calogero Zarba. Combining multisets with integers. In Proc. of the 18th International Conference on Automated Deduction (CADE'18), volume 2392 of Lecture Notes in Artificial Intelligence, pages 363-376, Copenhagen (Denmark), 2002. Springer-Verlag.
25. Marek W. Zawadowski. Descent and duality. Ann. Pure Appl. Logic, 71(2):131-188, 1995.