{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:47:54Z","timestamp":1725565674691},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223450"},{"type":"electronic","value":"9783540259848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25984-8_11","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:31:38Z","timestamp":1284172298000},"page":"183-197","source":"Crossref","is-referenced-by-count":6,"title":["A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvio","family":"Ghilardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cesare","family":"Tinelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01051766","volume":"2","author":"F. Baader","year":"1993","unstructured":"Baader, F., B\u00fcrckert, H.-J., Nebel, B., Nutt, W., Smolka, G.: On the expressivity of feature logics with negation, functional uncertainty, and sort equations. J. of Logic, Language and Information\u00a02, 1\u201318 (1993)","journal-title":"J. of Logic, Language and Information"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Ghilardi, S., Tinelli, C.: A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Technical Report 03-03, Department of Computer Science, The University of Iowa (December 2003)","DOI":"10.1007\/978-3-540-25984-8_11"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/BFb0018999","volume-title":"GWAI-92: Advances in Artificial Intelligence","author":"F. Baader","year":"1993","unstructured":"Baader, F., Hanschke, P.: Extensions of concept languages for a mechanical engineering application. In: Ohlbach, H.J. (ed.) GWAI 1992. LNCS, vol.\u00a0671, pp. 132\u2013143. Springer, Heidelberg (1993)"},{"key":"11_CR4","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. Journal of Artificial Intelligence Research\u00a016, 1\u201358 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"11_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, United Kingdom (1998)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-63104-6_3","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, pp. 19\u201333. Springer, Heidelberg (1997)"},{"issue":"2","key":"11_CR7","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":"11_CR8","series-title":"Oxford Logic Guides","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A. Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford Logic Guides, vol.\u00a035. Clarendon Press, Oxford (1997)"},{"key":"11_CR9","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":"11_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic, an Introduction","author":"B.F. Chellas","year":"1980","unstructured":"Chellas, B.F.: Modal Logic, an Introduction. Cambridge University Press, Cambridge (1980)"},{"key":"11_CR11","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 nondisjoint equational theories. In: Bundy, A. (ed.) CADE 1994. LNCS, vol.\u00a0814, pp. 267\u2013281. Springer, Heidelberg (1994)"},{"key":"11_CR12","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":"11_CR13","doi-asserted-by":"crossref","unstructured":"Ghilardi, S.: Model Theoretic Methods in Combined Constraint Satisfiability. Journal of Automated Reasoning (2004) (to appear)","DOI":"10.1007\/s10817-004-6241-5"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-39813-4_10","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Ghilardi","year":"2003","unstructured":"Ghilardi, S., Santocanale, L.: Algebraic and model theoretic techniques for fusion decidability in modal logics. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol.\u00a02850, pp. 152\u2013166. Springer, Heidelberg (2003)"},{"issue":"4","key":"11_CR15","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. The Journal of Symbolic Logic\u00a056(4), 1469\u20131485 (1991)","journal-title":"The Journal of Symbolic Logic"},{"key":"11_CR16","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: Bledsoe, W.W., Loveland, D.W. (eds.) Automated Theorem Proving: After 25 Years, Contemporary Mathematics, vol.\u00a029, pp. 201\u2013211. American Mathematical Society, Providence (1984)"},{"issue":"2","key":"11_CR17","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. on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"11_CR18","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. Journal of Symbolic Computation\u00a012, 633\u2013653 (1991)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"11_CR19","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":"11_CR20","series-title":"Studies in Logic and the Foundations of Mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(09)70074-6","volume-title":"An Algebraic Approach to Non-Classical Logics","author":"H. Rasiowa","year":"1974","unstructured":"Rasiowa, H.: An Algebraic Approach to Non-Classical Logics. Studies in Logic and the Foundations of Mathematics, vol.\u00a078. North Holland, Amsterdam (1974)"},{"issue":"1-2","key":"11_CR21","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.: Unification in a combination of arbitrary disjoint equational theories. Journal of Symbolic Computation\u00a08(1-2), 51\u2013100 (1989); Special issue on unification. Part II","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR22","unstructured":"Segerberg, K.: An Essay in Classical Modal Logic. Filosofiska Studier, vol.\u00a013. Uppsala Universitet (1971)"},{"key":"11_CR23","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands (1993)"},{"issue":"1","key":"11_CR24","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":"11_CR25","volume-title":"Advances in Modal Logic","author":"F. Wolter","year":"1998","unstructured":"Wolter, F.: Fusions of modal logics revisited. In: Kracht, M., de Rijke, M., Wansing, H., Zakharyaschev, M. (eds.) Advances in Modal Logic, CSLI, Stanford (1998)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25984-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T08:38:47Z","timestamp":1711787927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25984-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223450","9783540259848"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25984-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}