Connecting many-sorted structures and theories through adjoint functions

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

Volumn 3717 LNAI, Issue , 2005, Pages 31-47

  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

COMPONENT THEORIES; HOMOMORPHISMS; MODAL LOGICS; SHARED SIGNATURES;

ALGEBRA; DECISION THEORY; FORMAL LOGIC; TRANSFER FUNCTIONS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33646190465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_2     Document Type: Conference Paper

References (23)

1. F. Baader and S. Ghilardi. Connecting many-sorted theories. In Proc. CADE-20, Springer LNAI 3632, 2005. Extended version available on-line at http://lat.inf.tu-dresden.de/research/reports.html.
2. P. Baader, S. Ghilardi, and C. Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. In Proc. IJCAR'04, Springer LNAI 3097, 2004.
3. F. Baader, C. Lutz, H. Sturm, and P. Wolter. Fusions of description logics and abstract description systems. J. Artificial Intelligence Research, 16:1-58, 2002.
4. F. Baader and C. Tinelli. A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. In Proc. CADE-14, Springer LNAI 1249, 1997.
5. P. Baader and C. Tinelli. Deciding the word problem in the union of equational theories. Information and Computation, 178(2):346-390, 2002.
6. Ch.-Ch. Chang and H. J. Keisler. Model Theory. North-Holland, 3rd edition, 1990.
7. E. Domenjoud, P. Klay, and Ch. Ringeissen. Combination techniques for nondisjoint equational theories. In Proc. CADE-12, Springer LNAI 814, 1994.
8. C. Piorentini and S. Ghilardi. Combining word problems through rewriting in categories with products. Theoretical Computer Science, 294:103-149, 2003.
9. J. H. Gallier. Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row, 1986.
10. S. Ghilardi and G. C. Meloni. Modal logics with n-ary connectives. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 36(3):193-215, 1990.
11. S. Ghilardi. Model-theoretic methods in combined constraint satisfiability. J. Automated Reasoning, 33(3-4): 221-249, 2004.
12. S. Ghilardi and M. Zawadowski. Sheaves, Games and Model Completions, volume 14 of Trends in Logic. Kluwer Academic Publishers, 2002.
13. G. Grätzer. General lattice theory. Birkhäuser Verlag, Basel, second edition, 1998.
14. M. Kracht and P. Wolter. Properties of independently axiomatizable bimodal logics. J. Symbolic Logic, 56(4):1469-1485, 1991.
15. O. Kutz, C. Lutz, P. Wolter, and M. Zakharyaschev. ε-connections of abstract description systems. Artificial Intelligence, 156:1-73, 2004.
16. J. Lambek. The mathematics of sentence structure. The American Mathematical Monthly, 65:154-170, 1958.
17. G. Nelson. Combining satisfiability procedures by equality-sharing. In Automated Theorem Proving: After 25 Years, volume 29 of Contemporary Mathematics, pages 201-211. American Mathematical Society, 1984.
18. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Trans. on Programming Languages and Systems, 1(2):245-257, October 1979.
19. T. Nipkow. Combining matching algorithms: The regular case. J. Symbolic Computation, 12:633-653, 1991.
20. D. Pigozzi. The join of equational theories. Colloquium Mathematicum, 30(1):15-25, 1974.
21. E. Spaan. Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1993.
22. C. Tinelli and Ch. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290(1):291-353, 2003.
23. F. Wolter. Fusions of modal logics revisited. In Proc. Advances in Modal Logic, CSLI, Stanford, 1998.