Skip to main content
SpringerLink
Log in

A Tour of Franz Baader’s Contributions to Knowledge Representation and Automated Deduction

  • Chapter
  • First Online:
Description Logic, Theory Combination, and All That

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11560))

  • 710 Accesses

Abstract

This article provides an introduction to the Festschrift that has been put together on the occasion of Franz Baader’s 60th birthday to celebrate his fundamental and highly influential scientific contributions. We start with a brief and personal overview of Franz’s career, listing some important collaborators, places, and scientific milestones, and then provide first person accounts of how each one of us came in contact with Franz and how we benefitted from his collaboration and mentoring. Our selection is not intended to be complete and it is in fact strongly biased by our own personal experience and preferences. Many of Franz’s contributions that we had to leave out are discussed in later chapters of this volume.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baader, F.: Characterizations of unification type zero. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 2–14. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-51081-8_96

    Chapter  Google Scholar 

  2. Baader, F.: Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles. In: Proceedings of IJCAI (1991)

    Google Scholar 

  3. Baader, F.: Unification, weak unification, upper bound, lower bound, and generalization problems. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 86–97. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-53904-2_88

    Chapter  Google Scholar 

  4. Baader, F.: Unification in commutative theories, Hilbert’s basis theorem and Gröbner bases. J. ACM 40(3), 477–503 (1993)

    Article  MathSciNet  Google Scholar 

  5. Baader, F.: Combination of compatible reduction orderings that are total on ground terms. In: Proceedings of LICS, pp. 2–13 (1997)

    Google Scholar 

  6. Baader, F.: On the complexity of Boolean unification. Inf. Process. Lett. 67(4), 215–220 (1998)

    Article  MathSciNet  Google Scholar 

  7. 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–324 (2003)

    Google Scholar 

  8. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proceedings of IJCAI, pp. 325–330 (2003)

    Google Scholar 

  9. 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–476 (2016)

    Article  MathSciNet  Google Scholar 

  10. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\cal{EL}\) envelope. In: Proceedings of IJCAI, pp. 364–369 (2005)

    Google Scholar 

  11. Baader, F., Borgwardt, S., Lippmann, M.: Temporal query entailment in the description logic \(\cal{SHQ}\). J. Web Semant. 33, 71–93 (2015)

    Article  Google Scholar 

  12. Baader, F., Borgwardt, S., Morawska, B.: Extending unification in \(\cal{EL}\) towards general TBoxes. In: Proceedings of KR, pp. 568–572 (2012)

    Google Scholar 

  13. 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–28 (2016)

    MathSciNet  MATH  Google Scholar 

  14. 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)

    MATH  Google Scholar 

  15. Baader, F., Ghilardi, S.: Connecting many-sorted theories. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS, vol. 3632, pp. 278–294. Springer, Heidelberg (2005). https://doi.org/10.1007/11532231_21

    Chapter  Google Scholar 

  16. Baader, F., Ghilardi, S., Lutz, C.: LTL over description logic axioms. ACM Trans. Comput. Logic 13(3), 21:1–21:32 (2012)

    Article  MathSciNet  Google Scholar 

  17. 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–197. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25984-8_11

    Chapter  Google Scholar 

  18. 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–1452 (2006)

    Article  MathSciNet  Google Scholar 

  19. 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–86. Springer, Heidelberg (1991). https://doi.org/10.1007/BFb0013522

    Chapter  Google Scholar 

  20. Baader, F., Hladik, J., Lutz, C., Wolter, F.: From tableaux to automata for description logics. Fundamenta Informatica 57(2–4), 247–279 (2003)

    MathSciNet  MATH  Google Scholar 

  21. 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–281 (1992)

    Google Scholar 

  22. Baader, F., Hanschke, P.: A schema for integrating concrete domains into concept languages. In: Proceedings of IJCAI, pp. 452–457 (1991)

    Google Scholar 

  23. Baader, F., Küsters, 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–75. Springer, New York (2006). https://doi.org/10.1007/0-387-31072-X_1

    Chapter  Google Scholar 

  24. Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proceedings of IJCAI, pp. 96–101 (1999)

    Google Scholar 

  25. Baader, F., Kriegel, F., Nuradiansyah, A., Peñaloza, R.: Making repairs in description logics more gentle. In: Proceedings of KR, pp. 319–328 (2018)

    Google Scholar 

  26. 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–94. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66167-4_5

    Chapter  Google Scholar 

  27. Baader, F., Laux, A.: Terminological logics with modal operators. In: Proceedings of IJCAI, pp. 808–815 (1995)

    Google Scholar 

  28. Baader, F., Lippmann, M.: Runtime verification using the temporal description logic \(\cal{ALC}\)-LTL revisited. J. Appl. Logic 12(4), 584–613 (2014)

    Article  MathSciNet  Google Scholar 

  29. Baader, F., Lutz, C., Brandt, S.: Pushing the \(\cal{EL}\) envelope further. In: Proceedings of OWLED (2008)

    Google Scholar 

  30. Baader, F., Lutz, C., Milicic, M., Sattler, U., Wolter, F.: Integrating description logics and action formalisms: first results. In: Proceedings of IJCAI, pp. 572–577 (2005)

    Google Scholar 

  31. Baader, F., Lutz, C., Sturm, H., Wolter, F.: Fusions of description logics and abstract description systems. J. Artif. Intell. Res. 16, 1–58 (2002)

    Article  MathSciNet  Google Scholar 

  32. Baader, F., Morawska, B.: SAT encoding of unification in \(\cal{EL}\). In: Fermüller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 97–111. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16242-8_8

    Chapter  Google Scholar 

  33. 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–337 (1996)

    Article  Google Scholar 

  34. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Book  Google Scholar 

  35. Baader, F., Ohlbach, H.J.: A multi-dimensional terminological knowledge representation language. J. Appl. Non-Class. Logics 5(2), 153–197 (1995)

    Article  MathSciNet  Google Scholar 

  36. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and - what else? In: Proceedings of ECAI, pp. 298–302 (2004)

    Google Scholar 

  37. 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–65. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55602-8_155

    Chapter  Google Scholar 

  38. 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–125. Oxford University Press, Oxford (1994)

    Google Scholar 

  39. Baader, F., Schulz, K.: Combination techniques and decision problems for disunification. Theoret. Comput. Sci. 142, 229–255 (1995)

    Article  MathSciNet  Google Scholar 

  40. Baader, F., Schulz, K. (eds.): Frontiers of Combining Systems. Proceedings of First International Workshop. Kluwer Academic Publishers, Dordrecht (1996)

    MATH  Google Scholar 

  41. Baader, F., Sattler, U.: Description logics with aggregates and concrete domains. In: Proceedings of ECAI (1998)

    Google Scholar 

  42. Baader, F., Schulz, K.: Combination of constraint solvers for free and quasi-free structures. Theoret. Comput. Sci. 192, 107–161 (1998)

    Article  MathSciNet  Google Scholar 

  43. 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–263. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  44. Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, pp. 447–533. Elsevier Science Publishers, Amsterdam (2001)

    Google Scholar 

  45. Baader, F., Sertkaya, B., Turhan, A.-Y.: Computing the least common subsumer w.r.t. a background terminology. J. Appl. Logic 5(3), 392–420 (2007)

    Article  MathSciNet  Google Scholar 

  46. 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–33. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63104-6_3

    Chapter  Google Scholar 

  47. 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–189. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48685-2_14

    Chapter  Google Scholar 

  48. 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–274. Springer, Heidelberg (2000). https://doi.org/10.1007/10720084_17

    Chapter  MATH  Google Scholar 

  49. Baader, F., Tinelli, C.: Combining decision procedures for positive theories sharing constructors. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 352–366. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45610-4_25

    Chapter  Google Scholar 

  50. Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories. Inf. Comput. 178(2), 346–390 (2002)

    Article  MathSciNet  Google Scholar 

  51. Hollunder, B., Baader, F.: Qualifying number restrictions in concept languages. In: Proceedings of KR, pp. 335–346 (1991)

    Google Scholar 

  52. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst. 1(2), 245–257 (1979)

    Article  Google Scholar 

  53. 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–119. Springer, Dordrecht (1996). https://doi.org/10.1007/978-94-009-0349-4_5

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 03, Universität Bremen, Bremen, Germany

    Carsten Lutz

  2. School of Computer Science, University of Manchester, Manchester, UK

    Uli Sattler

  3. Department of Computer Science, The University of Iowa, Iowa City, USA

    Cesare Tinelli

  4. Institute for Theoretical Computer Science, Dresden University of Technology, Dresden, Germany

    Anni-Yasmin Turhan

  5. Department of Computer Science, University of Liverpool, Liverpool, UK

    Frank Wolter

Authors
  1. Carsten Lutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uli Sattler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cesare Tinelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Anni-Yasmin Turhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Frank Wolter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anni-Yasmin Turhan .

Editor information

Editors and Affiliations

  1. University of Bremen, Bremen, Germany

    Carsten Lutz

  2. University of Manchester, Manchester, UK

    Uli Sattler

  3. University of Iowa, Iowa City, IA, USA

    Cesare Tinelli

  4. TU Dresden, Dresden, Germany

    Anni-Yasmin Turhan

  5. University of Liverpool, Liverpool, UK

    Frank Wolter

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Lutz, C., Sattler, U., Tinelli, C., Turhan, AY., Wolter, F. (2019). A Tour of Franz Baader’s Contributions to Knowledge Representation and Automated Deduction. In: Lutz, C., Sattler, U., Tinelli, C., Turhan, AY., Wolter, F. (eds) Description Logic, Theory Combination, and All That. Lecture Notes in Computer Science(), vol 11560. Springer, Cham. https://doi.org/10.1007/978-3-030-22102-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22102-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22101-0

  • Online ISBN: 978-3-030-22102-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation