{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:46:57Z","timestamp":1725475617020},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672814"},{"type":"electronic","value":"9783540464211"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720084_17","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T14:36:30Z","timestamp":1167402990000},"page":"260-274","source":"Crossref","is-referenced-by-count":6,"title":["Combining Equational Theories Sharing Non-Collapse-Free Constructors"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]},{"given":"Cesare","family":"Tinelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Narendran, P.: Unification of concept terms in description logics. In: Prade, H. (ed.) Proc. of ECAI 1998, pp. 331\u2013335. John Wiley & Sons Ltd., Chichester (1998)","DOI":"10.25368\/2022.83"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(97)00147-3","volume":"192","author":"F. Baader","year":"1998","unstructured":"Baader, F., Schulz, K.U.: Combination of constraint solvers for free and quasi-free structures. Theoretical Computer Science \u00a0192, 107\u2013161 (1998)","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Tinelli, C.: Combining equational theories sharing non-collapse-free constructors. TR 99-13, Dept. of Computer Science, University of Iowa (1999)","DOI":"10.1007\/10720084_17"},{"key":"#cr-split#-17_CR4.1","doi-asserted-by":"crossref","unstructured":"Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories sharing constructors. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 175\u2013189. Springer, Heidelberg (1999);","DOI":"10.1007\/3-540-48685-2_14"},{"key":"#cr-split#-17_CR4.2","unstructured":"Longer version available as TR UIUCDCS-R-98-2073, Dept. of Computer Science, University of Illinois at Urbana-Champaign (1998)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/3-540-58156-1_19","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, pp. 267\u2013281. Springer, Heidelberg (1994)"},{"key":"17_CR6","first-page":"164","volume-title":"Proc. of LIC 1994","author":"E. Hemaspaandra","year":"1994","unstructured":"Hemaspaandra, E.: Complexity transfer for modal logic (extended abstract). In: Proc. of LIC 1994, pp. 164\u2013173. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"17_CR7","unstructured":"Koppelberg, S.: General theory of Boolean algebras. In: Monk, J. (ed.) Handbook of Boolean Algebras. North-Holland, Amsterdam (1988)"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1004900300438","volume":"59","author":"M. Kracht","year":"1997","unstructured":"Kracht, M., Wolter, F.: Simulation and transfer results in modal logic: A survey. Studia Logica\u00a059, 149\u2013177 (1997)","journal-title":"Studia Logica"},{"key":"17_CR9","volume-title":"Tools and Techniques in Modal Logic","author":"M. Kracht","year":"1999","unstructured":"Kracht, M.: Tools and Techniques in Modal Logic. Elsevier, Amsterdam (1999)"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.2307\/2270619","volume":"31","author":"E.J. Lemmon","year":"1966","unstructured":"Lemmon, E.J.: Algebraic semantics for modal logics. J. of Symbolic Logic\u00a031(1), 46\u201365 (1966)","journal-title":"J. of Symbolic Logic"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/3-540-51081-8_118","volume-title":"Rewriting Techniques and Applications","author":"T. Nipkow","year":"1989","unstructured":"Nipkow, T.: Combining matching algorithms: The regular case. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 343\u2013358. Springer, Heidelberg (1989)"},{"issue":"1","key":"17_CR12","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"},{"issue":"1-2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0747-7171(89)80022-7","volume":"8","author":"M. Schmidt-Schau\u00df","year":"1989","unstructured":"Schmidt-Schau\u00df, M.: Combination of unification algorithms. J. of Symbolic Computation\u00a08(1-2), 51\u2013100 (1989)","journal-title":"J. of Symbolic Computation"},{"key":"17_CR14","unstructured":"Tinelli, C., Ringeissen, C.: Non-disjoint unions of theories and combinations of satisfiability procedures: First results. TR UIUCDCS-R-98-2044, Dept. of Computer Science. University of Illinois at Urbana-Champaign (1998)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720084_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T07:05:41Z","timestamp":1683702341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720084_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672814","9783540464211"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/10720084_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}