{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:37:07Z","timestamp":1726033027348},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030221010"},{"type":"electronic","value":"9783030221027"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22102-7_1","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T12:21:26Z","timestamp":1561465286000},"page":"1-14","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Tour of Franz Baader\u2019s Contributions to Knowledge Representation and Automated Deduction"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Lutz","sequence":"first","affiliation":[]},{"given":"Uli","family":"Sattler","sequence":"additional","affiliation":[]},{"given":"Cesare","family":"Tinelli","sequence":"additional","affiliation":[]},{"given":"Anni-Yasmin","family":"Turhan","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Wolter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-51081-8_96","volume-title":"Rewriting Techniques and Applications","author":"F Baader","year":"1989","unstructured":"Baader, F.: Characterizations of unification type zero. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 2\u201314. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51081-8_96"},{"key":"1_CR2","unstructured":"Baader, F.: Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles. In: Proceedings of IJCAI (1991)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-53904-2_88","volume-title":"Rewriting Techniques and Applications","author":"F Baader","year":"1991","unstructured":"Baader, F.: Unification, weak unification, upper bound, lower bound, and generalization problems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 86\u201397. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-53904-2_88"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1145\/174130.174133","volume":"40","author":"F Baader","year":"1993","unstructured":"Baader, F.: Unification in commutative theories, Hilbert\u2019s basis theorem and Gr\u00f6bner bases. J. ACM 40(3), 477\u2013503 (1993)","journal-title":"J. ACM"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F.: Combination of compatible reduction orderings that are total on ground terms. In: Proceedings of LICS, pp. 2\u201313 (1997)","DOI":"10.25368\/2022.68"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0020-0190(98)00106-9","volume":"67","author":"F Baader","year":"1998","unstructured":"Baader, F.: On the complexity of Boolean unification. Inf. Process. Lett. 67(4), 215\u2013220 (1998)","journal-title":"Inf. Process. Lett."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Proceedings of IJCAI, pp. 319\u2013324 (2003)","DOI":"10.25368\/2022.125"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proceedings of IJCAI, pp. 325\u2013330 (2003)","DOI":"10.25368\/2022.120"},{"issue":"4","key":"1_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1215\/00294527-3555507","volume":"57","author":"F Baader","year":"2016","unstructured":"Baader, F., Binh, N.T., Borgwardt, S., Morawska, B.: Deciding unifiability and computing local unifiers in the description logic $$\\cal{EL}$$ without top constructor. Notre Dame J. Formal Logic 57(4), 443\u2013476 (2016)","journal-title":"Notre Dame J. Formal Logic"},{"key":"1_CR10","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Proceedings of IJCAI, pp. 364\u2013369 (2005)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.websem.2014.11.008","volume":"33","author":"F Baader","year":"2015","unstructured":"Baader, F., Borgwardt, S., Lippmann, M.: Temporal query entailment in the description logic $$\\cal{SHQ}$$ . J. Web Semant. 33, 71\u201393 (2015)","journal-title":"J. Web Semant."},{"key":"1_CR12","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Extending unification in $$\\cal{EL}$$ towards general TBoxes. In: Proceedings of KR, pp. 568\u2013572 (2012)"},{"issue":"4:1","key":"1_CR13","first-page":"1","volume":"12","author":"F Baader","year":"2016","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Extending unification in $$\\cal{EL}$$ to disunification: the case of dismatching and local disunification. Log. Methods Comput. Sci. 12(4:1), 1\u201328 (2016)","journal-title":"Log. Methods Comput. Sci."},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"1_CR14","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"1_CR15","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. 3632, pp. 278\u2013294. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_21"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2287718.2287721","volume":"13","author":"F Baader","year":"2012","unstructured":"Baader, F., Ghilardi, S., Lutz, C.: LTL over description logic axioms. ACM Trans. Comput. Logic 13(3), 21:1\u201321:32 (2012)","journal-title":"ACM Trans. Comput. Logic"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","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, vol. 3097, pp. 183\u2013197. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25984-8_11"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1016\/j.ic.2005.05.009","volume":"10","author":"F Baader","year":"2006","unstructured":"Baader, F., Ghilardi, S., Tinelli, C.: A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Inf. Comput. 10, 1413\u20131452 (2006)","journal-title":"Inf. Comput."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0013522","volume-title":"Processing Declarative Knowledge","author":"F Baader","year":"1991","unstructured":"Baader, F., Hollunder, B.: A terminological knowledge representation system with complete inference algorithms. In: Boley, H., Richter, M.M. (eds.) PDK 1991. LNCS, vol. 567, pp. 67\u201386. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0013522"},{"issue":"2\u20134","key":"1_CR20","first-page":"247","volume":"57","author":"F Baader","year":"2003","unstructured":"Baader, F., Hladik, J., Lutz, C., Wolter, F.: From tableaux to automata for description logics. Fundamenta Informatica 57(2\u20134), 247\u2013279 (2003)","journal-title":"Fundamenta Informatica"},{"key":"1_CR21","unstructured":"Baader, F., Hollunder, B., Nebel, B., Profitlich, H.-J., Franconi, E.: An empirical analysis of optimization techniques for terminological representation systems. In: Proceedings of KR, pp. 270\u2013281 (1992)"},{"key":"1_CR22","unstructured":"Baader, F., Hanschke, P.: A schema for integrating concrete domains into concept languages. In: Proceedings of IJCAI, pp. 452\u2013457 (1991)"},{"key":"1_CR23","series-title":"International Mathematical Series","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-387-31072-X_1","volume-title":"Mathematical Problems from Applied Logic I","author":"F Baader","year":"2006","unstructured":"Baader, F., K\u00fcsters, R.: Nonstandard inferences in description logics: the story so far. In: Gabbay, D.M., Goncharov, S.S., Zakharyaschev, M. (eds.) Mathematical Problems from Applied Logic I. IMAT, vol. 4, pp. 1\u201375. Springer, New York (2006). https:\/\/doi.org\/10.1007\/0-387-31072-X_1"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Baader, F., K\u00fcsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proceedings of IJCAI, pp. 96\u2013101 (1999)","DOI":"10.25368\/2022.85"},{"key":"1_CR25","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Proceedings of KR, pp. 319\u2013328 (2018)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-66167-4_5","volume-title":"Frontiers of Combining Systems","author":"F Baader","year":"2017","unstructured":"Baader, F., Koopmann, P., Turhan, A.-Y.: Using ontologies to query probabilistic numerical data. In: Dixon, C., Finger, M. (eds.) FroCoS 2017. LNCS, vol. 10483, pp. 77\u201394. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66167-4_5"},{"key":"1_CR27","unstructured":"Baader, F., Laux, A.: Terminological logics with modal operators. In: Proceedings of IJCAI, pp. 808\u2013815 (1995)"},{"issue":"4","key":"1_CR28","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.jal.2014.09.001","volume":"12","author":"F Baader","year":"2014","unstructured":"Baader, F., Lippmann, M.: Runtime verification using the temporal description logic $$\\cal{ALC}$$ -LTL revisited. J. Appl. Logic 12(4), 584\u2013613 (2014)","journal-title":"J. Appl. Logic"},{"key":"1_CR29","unstructured":"Baader, F., Lutz, C., Brandt, S.: Pushing the $$\\cal{EL}$$ envelope further. In: Proceedings of OWLED (2008)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Baader, F., Lutz, C., Milicic, M., Sattler, U., Wolter, F.: Integrating description logics and action formalisms: first results. In: Proceedings of IJCAI, pp. 572\u2013577 (2005)","DOI":"10.25368\/2010.145"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.919","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. Artif. Intell. Res. 16, 1\u201358 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-16242-8_8","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F Baader","year":"2010","unstructured":"Baader, F., Morawska, B.: SAT encoding of unification in $$\\cal{EL}$$ . In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 97\u2013111. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_8"},{"issue":"4","key":"1_CR33","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01195536","volume":"7","author":"F Baader","year":"1996","unstructured":"Baader, F., Nutt, W.: Combination problems for commutative\/monoidal theories: how algebra can help in equational reasoning. J. Appl. Algebra Eng. Commun. Comput. 7(4), 309\u2013337 (1996)","journal-title":"J. Appl. Algebra Eng. Commun. Comput."},{"key":"1_CR34","doi-asserted-by":"publisher","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, Cambridge (1998)"},{"issue":"2","key":"1_CR35","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1080\/11663081.1995.10510854","volume":"5","author":"F Baader","year":"1995","unstructured":"Baader, F., Ohlbach, H.J.: A multi-dimensional terminological knowledge representation language. J. Appl. Non-Class. Logics 5(2), 153\u2013197 (1995)","journal-title":"J. Appl. Non-Class. Logics"},{"key":"1_CR36","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: Proceedings of ECAI, pp. 298\u2013302 (2004)"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-55602-8_155","volume-title":"Automated Deduction\u2014CADE 2011","author":"F Baader","year":"1992","unstructured":"Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories: combining decision procedures. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 50\u201365. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55602-8_155"},{"key":"1_CR38","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/oso\/9780198537465.003.0002","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"F Baader","year":"1994","unstructured":"Baader, F., Siekmann, J.: Unification theory. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, pp. 41\u2013125. Oxford University Press, Oxford (1994)"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-3975(94)00277-0","volume":"142","author":"F Baader","year":"1995","unstructured":"Baader, F., Schulz, K.: Combination techniques and decision problems for disunification. Theoret. Comput. Sci. 142, 229\u2013255 (1995)","journal-title":"Theoret. Comput. Sci."},{"volume-title":"Frontiers of Combining Systems. Proceedings of First International Workshop","year":"1996","key":"1_CR40","unstructured":"Baader, F., Schulz, K. (eds.): Frontiers of Combining Systems. Proceedings of First International Workshop. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Baader, F., Sattler, U.: Description logics with aggregates and concrete domains. In: Proceedings of ECAI (1998)","DOI":"10.25368\/2022.78"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(97)00147-3","volume":"192","author":"F Baader","year":"1998","unstructured":"Baader, F., Schulz, K.: Combination of constraint solvers for free and quasi-free structures. Theoret. Comput. Sci. 192, 107\u2013161 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR43","unstructured":"Baader, F., Schulz, K.: Unification theory. In: Bibel, W., Schmidt, P.H. (eds.) Automated Deduction - A Basis for Applications, Vol. I: Foundations - Calculi and Methods. Applied Logic Series, vol. 8, pp. 225\u2013263. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"1_CR44","first-page":"447","volume-title":"Handbook of Automated Reasoning","author":"F Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 447\u2013533. Elsevier Science Publishers, Amsterdam (2001)"},{"issue":"3","key":"1_CR45","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.jal.2006.03.002","volume":"5","author":"F Baader","year":"2007","unstructured":"Baader, F., Sertkaya, B., Turhan, A.-Y.: Computing the least common subsumer w.r.t. a background terminology. J. Appl. Logic 5(3), 392\u2013420 (2007)","journal-title":"J. Appl. Logic"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-63104-6_3","volume-title":"Automated Deduction\u2014CADE-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. 1249, pp. 19\u201333. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63104-6_3"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-48685-2_14","volume-title":"Rewriting Techniques and Applications","author":"F Baader","year":"1999","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. 1631, pp. 175\u2013189. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48685-2_14"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/10720084_17","volume-title":"Frontiers of Combining Systems","author":"F Baader","year":"2000","unstructured":"Baader, F., Tinelli, C.: Combining equational theories sharing non-collapse-free constructors. In: Kirchner, H., Ringeissen, C. (eds.) FroCoS 2000. LNCS, vol. 1794, pp. 260\u2013274. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10720084_17"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-45610-4_25","volume-title":"Rewriting Techniques and Applications","author":"F Baader","year":"2002","unstructured":"Baader, F., Tinelli, C.: Combining decision procedures for positive theories sharing constructors. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 352\u2013366. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45610-4_25"},{"issue":"2","key":"1_CR50","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. Inf. Comput. 178(2), 346\u2013390 (2002)","journal-title":"Inf. Comput."},{"key":"1_CR51","unstructured":"Hollunder, B., Baader, F.: Qualifying number restrictions in concept languages. In: Proceedings of KR, pp. 335\u2013346 (1991)"},{"issue":"2","key":"1_CR52","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. Program. Lang. Syst. 1(2), 245\u2013257 (1979)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR53","series-title":"Applied Logic Series","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-94-009-0349-4_5","volume-title":"Frontiers of Combining Systems","author":"C Tinelli","year":"1996","unstructured":"Tinelli, C., Harandi, M.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems. ALS, vol. 3, pp. 103\u2013119. Springer, Dordrecht (1996). https:\/\/doi.org\/10.1007\/978-94-009-0349-4_5"}],"container-title":["Lecture Notes in Computer Science","Description Logic, Theory Combination, and All That"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22102-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T05:33:42Z","timestamp":1721453622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22102-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030221010","9783030221027"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22102-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}