{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:28Z","timestamp":1725550588058},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290513"},{"type":"electronic","value":"9783540317302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11559306_2","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T12:50:36Z","timestamp":1127825436000},"page":"31-47","source":"Crossref","is-referenced-by-count":5,"title":["Connecting Many-Sorted Structures and Theories Through Adjoint Functions"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]},{"given":"Silvio","family":"Ghilardi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/11532231_21","volume-title":"Automated Deduction \u2013 CADE-20","author":"F. Baader","year":"2005","unstructured":"Baader, F., Ghilardi, S.: Connecting many-sorted theories. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol.\u00a03632, pp. 278\u2013294. Springer, Heidelberg (2005), \n                    \n                      http:\/\/lat.inf.tu-dresden.de\/research\/reports.html"},{"key":"2_CR2","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-25984-8_11","volume-title":"Automated Reasoning","author":"F. Baader","year":"2004","unstructured":"Baader, F., Ghilardi, S., Tinelli, C.: A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 183\u2013197. Springer, Heidelberg (2004)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/088395102753365771","volume":"16","author":"F. Baader","year":"2002","unstructured":"Baader, F., Lutz, C., Sturm, H., Wolter, F.: Fusions of description logics and abstract description systems. J. Artificial Intelligence Research\u00a016, 1\u201358 (2002)","journal-title":"J. Artificial Intelligence Research"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Deduction - CADE-14","author":"F. Baader","year":"1997","unstructured":"Baader, F., Tinelli, C.: A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249. Springer, Heidelberg (1997)"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/inco.2001.3118","volume":"178","author":"F. Baader","year":"2002","unstructured":"Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Information and Computation\u00a0178(2), 346\u2013390 (2002)","journal-title":"Information and Computation"},{"key":"2_CR6","volume-title":"Model Theory","author":"C..-C.. Chang","year":"1990","unstructured":"Chang, C.-C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland, Amsterdam (1990)","edition":"3"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Deduction - CADE-12","author":"E. Domenjoud","year":"1994","unstructured":"Domenjoud, E., Klay, F., Ringeissen, C.: Combination techniques for non-disjoint equational theories. In: Bundy, A. (ed.) CADE 1994. LNCS, vol.\u00a0814. Springer, Heidelberg (1994)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(01)00248-1","volume":"294","author":"C. Fiorentini","year":"2003","unstructured":"Fiorentini, C., Ghilardi, S.: Combining word problems through rewriting in categories with products. Theoretical Computer Science\u00a0294, 103\u2013149 (2003)","journal-title":"Theoretical Computer Science"},{"key":"2_CR9","volume-title":"Logic for Computer Science: Foundations of Automatic Theorem Proving","author":"J.H. Gallier","year":"1986","unstructured":"Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row, New York (1986)"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/malq.19900360303","volume":"36","author":"S. Ghilardi","year":"1990","unstructured":"Ghilardi, S., Meloni, G.C.: Modal logics with n-ary connectives. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a036(3), 193\u2013215 (1990)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"issue":"3\u20134","key":"2_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10817-004-6241-5","volume":"33","author":"S. Ghilardi","year":"2004","unstructured":"Ghilardi, S.: Model-theoretic methods in combined constraint satisfiability. J. Automated Reasoning\u00a033(3\u20134), 221\u2013249 (2004)","journal-title":"J. Automated Reasoning"},{"key":"2_CR12","series-title":"Trends in Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9936-8","volume-title":"Sheaves, Games and Model Completions","author":"S. Ghilardi","year":"2002","unstructured":"Ghilardi, S., Zawadowski, M.: Sheaves, Games and Model Completions. Trends in Logic, vol.\u00a014. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"2_CR13","volume-title":"General lattice theory","author":"G. Gr\u00e4tzer","year":"1998","unstructured":"Gr\u00e4tzer, G.: General lattice theory, 2nd edn. Birkh\u00e4user Verlag, Basel (1998)","edition":"2"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.2307\/2275487","volume":"56","author":"M. Kracht","year":"1991","unstructured":"Kracht, M., Wolter, F.: Properties of independently axiomatizable bimodal logics. J. Symbolic Logic\u00a056(4), 1469\u20131485 (1991)","journal-title":"J. Symbolic Logic"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.02.002","volume":"156","author":"O. Kutz","year":"2004","unstructured":"Kutz, O., Lutz, C., Wolter, F., Zakharyaschev, M.: \n                    \n                      \n                    \n                    $\\mathcal{E}$\n                  -connections of abstract description systems. Artificial Intelligence\u00a0156, 1\u201373 (2004)","journal-title":"Artificial Intelligence"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. The American Mathematical Monthly\u00a065, 154\u2013170 (1958)","journal-title":"The American Mathematical Monthly"},{"key":"2_CR17","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1090\/conm\/029\/11","volume-title":"Automated Theorem Proving: After 25 Years","author":"G. Nelson","year":"1984","unstructured":"Nelson, G.: Combining satisfiability procedures by equality-sharing. In: Automated Theorem Proving: After 25 Years. Contemporary Mathematics, vol.\u00a029, pp. 201\u2013211. American Mathematical Society, Providence (1984)"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans.\u00a0on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Trans.\u00a0on Programming Languages and Systems"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0747-7171(08)80145-9","volume":"12","author":"T. Nipkow","year":"1991","unstructured":"Nipkow, T.: Combining matching algorithms: The regular case. J. Symbolic Computation\u00a012, 633\u2013653 (1991)","journal-title":"J. Symbolic Computation"},{"issue":"1","key":"2_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.4064\/cm-30-1-15-25","volume":"30","author":"D. Pigozzi","year":"1974","unstructured":"Pigozzi, D.: The join of equational theories. Colloquium Mathematicum\u00a030(1), 15\u201325 (1974)","journal-title":"Colloquium Mathematicum"},{"key":"2_CR21","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands (1993)"},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(01)00332-2","volume":"290","author":"C. Tinelli","year":"2003","unstructured":"Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science\u00a0290(1), 291\u2013353 (2003)","journal-title":"Theoretical Computer Science"},{"key":"2_CR23","volume-title":"Proc. Advances in Modal Logic","author":"F. Wolter","year":"1998","unstructured":"Wolter, F.: Fusions of modal logics revisited. In: Proc. Advances in Modal Logic. CSLI, Stanford (1998)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11559306_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:51Z","timestamp":1619507511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11559306_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290513","9783540317302"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11559306_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}