Skip to main content
SpringerLink
Log in

Logic-Based Knowledge Representation

  • Chapter
  • First Online:
Artificial Intelligence Today

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1600))

Abstract

After a short analysis of the requirements that a knowledge representation language must satisfy, we introduce Description Logics, Modal Logics, and Nonmonotonic Logics as formalisms for representing terminological knowledge, time-dependent or subjective knowledge, and incomplete knowledge respectively. At the end of each section, we briefly comment on the connection to Logic Programming.

This is an extended and updated version of an article that has appeared (in German) in the journal KI, 3/96:8–16, 1996.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and Z. Manna. Temporal logic programming. Journal of Symbolic Computation, 8:277–295, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  2. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Research Report ML-96-03, ILLC, Amsterdam, 1996.

    MATH  Google Scholar 

  3. G. Antoniou. Nonmonotonic Reasoning. MIT Press, Cambridge, Mass., 1997.

    MATH  Google Scholar 

  4. K. R. Apt and R. N. Bol. Logic programming and negation: A survey. Journal of Logic Programming, 19–20:9–71, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  5. F. Baader. Terminological cycles in KL-ONE-based knowledge representation languages. In T. Dietterich and W. Swartout, editors, Proceedings of the 8th National Conference on Artificial Intelligence, pages 621–626, Boston, Mass., 1990. AAAI Press / MIT Press.

    Google Scholar 

  6. F. Baader. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 446–451, Sydney, Australia, 1991. Morgan Kaufmann, San Francisco.

    Google Scholar 

  7. F. Baader. Using automata theory for characterizing the semantics of terminological cycles. Annals of Mathematics and Artificial Intelligence, 18(2–4):175–219, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  8. F. Baader, M. Buchheit, and B. Hollunder. Cardinality restrictions on concepts. Artificial Intelligence, 88(1–2):195–213, 1996.

    Article  MATH  Google Scholar 

  9. F. Baader, H.-J. Bürckert, J. Heinsohn, J. Müller, B. Hollunder, B. Nebel, W. Nutt, and H.-J. Profitlich. Terminological knowledge representation: A proposal for a terminological logic. DFKI Technical Memo TM-90-04, Deutsches Forschungszentrum für Künstliche Intelligenz, Kaiserslautern, 1990.

    Google Scholar 

  10. F. Baader, H.-J. Bürckert, B. Hollunder, W. Nutt, and J. Siekmann. Concept logics. In J. W. Lloyd, editor, Proceedings of the Symposium on Computational Logic, pages 177–201. Brussels, 1990. Springer-Verlag.

    Google Scholar 

  11. F. Baader, E. Franconi, B. Hollunder, B. Nebel, and H.-J. Profitlich. An empirical analysis of optimization techniques for terminological systems. Journal of Applied Intelligence, 4:109–132, 1994.

    Article  Google Scholar 

  12. F. Baader and P. Hanschke. A scheme for integrating concrete domains into concept languages. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 452–457, Sydney, Australia, 1991. Morgan Kaufmann, San Francisco.

    Google Scholar 

  13. F. Baader and P. Hanschke. Extensions of concept languages for a mechanical engineering application. In Proceedings of the 16th German AI-Conference, GWAI-92, volume 671 of Lecture Notes in Computer Science, pages 132–143, Bonn (Germany), 1993. Springer-Verlag.

    Google Scholar 

  14. F. Baader and B. Hollunder. KRIS: Knowledge Representation and Inference System. SIGART Bulletin, 2(3):8–14, 1991.

    Article  Google Scholar 

  15. F. Baader and B. Hollunder. A terminological knowledge representation system with complete inference algorithms. In M. Richter and H. Boley, editors, Proceedings of the First International Workshop on Processing Declarative Knowledge (PDK-91), volume 567 of Lecture Notes in Computer Science, pages 67–85, Kaiserslautern (Germany), 1991. Springer-Verlag.

    Chapter  Google Scholar 

  16. F. Baader and B. Hollunder. Embedding defaults into terminological representation systems. J. Automated Reasoning, 14:149–180, 1995.

    Article  MATH  Google Scholar 

  17. F. Baader and B. Hollunder. Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. J. Automated Reasoning, 15:41–68, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  18. F. Baader and A. Laux. Terminological logics with modal operators. In C. Mellish, editor, Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 808–814, Montreal, Canada, 1995. Morgan Kaufmann, San Francisco.

    Google Scholar 

  19. F. Baader and H.-J. Ohlbach. A multi-dimensional terminological knowledge representation language. Journal of Applied Non-Classical Logics, 5(2):153–197, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  20. F. Baader and U. Sattler. Description logics with symbolic number restrictions. In W. Wahlster, editor, Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI-96), pages 283–287. John Wiley & Sons Ltd, 1996.

    Google Scholar 

  21. F. Baader and U. Sattler. Number restrictions on complex roles in description logics. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth. International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), pages 328–339, Cambridge, Mass., 1996. Morgan Kaufmann, San Francisco.

    Google Scholar 

  22. F. Baader and U. Sattler. Description logics with concrete domains and aggregation. In H. Prade, editor, Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 336–340. John Wiley & Sons Ltd, 1998.

    Google Scholar 

  23. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19–20:73–148, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  24. S. Bergamaschi and D. Beneventano. Incoherence and subsumption for recursive views and queries in object-oriented data models. Data and Knowledge Engineering, 21(3):217–252, 1997.

    Article  MATH  Google Scholar 

  25. S. Bergamaschi, C. Sartori, D. Beneventano, and M. Vincini. ODB-tools: a description logics based tool for schema validation and semantic query optimization in object oriented databases. In M. Lenzerini, editor, Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence: Advances in Artificial Intelligence (AI*IA-97), volume 1321 of Lecture Notes in Artificial Intelligence, pages 435–438. Springer-Verlag, 1997.

    Google Scholar 

  26. E. W. Beth. The Foundations of Mathematics. North-Holland, Amsterdam, 1959.

    MATH  Google Scholar 

  27. N. Bidoit and C. Froidevaux. Negation by default and unstratified logic programs. Theoretical Computer Science, 78:85–112, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  28. A. Borgida. On the relative expressiveness of description logics and predicate logics. Journal of Artificial Intelligence, 82(1–2):353–367, 1996.

    Article  MathSciNet  Google Scholar 

  29. A. Borgida, R. J. Brachman, D. L. McGuinness, and L. A. Resnick. CLASSIC: A structural data model for objects. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, pages 59–67, Portland, Oreg., 1989.

    Google Scholar 

  30. A. Borgida and P. Patel-Schneider. A semantics and complete algorithm for subsumption in the CLASSIC description logic. Journal of Artificial Intelligence Research, 1:277–308, 1994.

    MATH  Google Scholar 

  31. R. J. Brachman. What’s in a concept: Structural foundations for semantic networks. International Journal of Man-Machine Studies, 9:127–152, 1977.

    Article  Google Scholar 

  32. R. J. Brachman. Structured inheritance networks. In W. A. Woods and R. J. Brachman, editors, Research in Natural Language Understanding, Quarterly Progress Report No. 1, BBN Report No. 3742, pages 36–78. Bolt, Beranek and Newman Inc., Cambridge, Mass., 1978.

    Google Scholar 

  33. R. J. Brachman, D. L. McGuinness, P. F. Patel-Schneider, L. A. Resnick, and A. Borgida. Living with CLASSIC: When and how to use a KL-ONE-like language. In J. Sowa, editor, Principles of Semantic Networks, pages 401–456. Morgan Kaufmann, San Francisco, 1991.

    Chapter  Google Scholar 

  34. R. J. Brachman and J. G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2): 171–216, 1985.

    Article  Google Scholar 

  35. S. Brass and J. Dix. Disjunctive semantics based upon partial and bottom-up evaluation. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 199–213. MIT Press, 1995.

    Google Scholar 

  36. P. Bresciani, E. Franconi, and S. Tessaris. Implementing and testing expressive description logics: A preliminary report. In Proceedings of the International Symposium on Knowledge Retrieval, Use, and Storage for Efficiency, KRUSE-95, Santa Cruz, USA, 1995.

    Google Scholar 

  37. G. Brewka. Nonmonotonic Reasoning. Cambridge University Press, Cambridge, UK, 1991.

    MATH  Google Scholar 

  38. G. Brewka, J. Dix, and K. Konolige. Nonmonotonic Reasoning: An Overview. CSLI Publications, Center for the Study of Language and Information, Stanford, Cal., 1997.

    MATH  Google Scholar 

  39. F. M. Brown, editor. The Frame Problem in Artificial Intelligence: Proceedings of the 1987 Workshop. Morgan Kaufman, 1987.

    Google Scholar 

  40. M. Buchheit, F. M. Donini, and A. Schaerf. Decidable reasoning in terminological knowledge representation systems. Journal of Artificial Intelligence Research, 1:109–138, 1993.

    MathSciNet  MATH  Google Scholar 

  41. M. Buchheit, M. Jeusfeld, W. Nutt, and M. Staudt. Subsumption of queries to object-oriented databases. Information Systems, 19(1):33–54, 1994.

    Article  Google Scholar 

  42. M. Buchheit, R. Klein, and W. Nutt. Configuration as model construction: The constructive problem solving approach. In Proceedings of the Third International Conference on Artificial Intelligence in Design, AID’94, Lausanne, Switzerland, 1994.

    Google Scholar 

  43. D. Calvanese. Finite model reasoning in description logics. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), pages 292–303, Cambridge, Mass., 1996. Morgan Kaufmann, San Francisco.

    Google Scholar 

  44. B. F. Chellas. Modal Logic: An Introduction. Cambridge University Press, Cambridge, UK, 1980.

    Book  MATH  Google Scholar 

  45. K. Clark. Negation as Failure. In Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.

    Chapter  Google Scholar 

  46. G. De Giacomo. Decidability of Class-Based Knowledge Representation Formalisms. PhD thesis, Università degli Studi di Roma “La Sapienza”, Italy, 1995.

    Google Scholar 

  47. G. De Giacomo. Eliminating “converse” from converse PDL. Journal of Logic, Language, and Information, 5:193–208, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  48. H. de Nivelle. A resolution decision procedure for the guarded fragment. In C. Kirchner and H. Kirchner, editors, Proceedings of the 15th International Conference on Automated Deduction (CADE-15), volume 1421 of Lecture Notes in Artificial Intelligence, pages 191–204, Lindau, Germany, 1998. Springer-Verlag.

    Google Scholar 

  49. L. Farinãs del Cerro. Molog: A system that extends Prolog with modal logic. New Generation Computing, 4:35–50, 1986.

    Article  MATH  Google Scholar 

  50. P. Devanbu, R. J. Brachman, P. G. Selfridgc, and B. W. Ballard. LaSSIE: A knowledge-based software information system. Communications of the ACM, 34(5):34–49, 1991.

    Article  Google Scholar 

  51. J. Dix. A classification-theory of semantics of normal logic programs: I. Strong properties. Fundamenta Informaticae, XXII(3):227–255, 1995.

    MathSciNet  MATH  Google Scholar 

  52. J. Dix. A classification-theory of semantics of normal logic programs: II. Weak properties. Fundamenta Informaticae, XXII(3):257–288, 1995.

    MathSciNet  MATH  Google Scholar 

  53. J. Dix. Semantics of logic programs: Their intuitions and formal properties. An overview. In A. Fuhrmann and H. Rott, editors, Logic, Action and Information — Essays on Logic in Philosophy and Artificial Intelligence, pages 241–327. DeGruyter, 1995.

    Google Scholar 

  54. J. Dix, U. Furbach, and A. Nerode, editors. Logic Programming and Nonmonotonic Reasoning, Fourth International Conference, volume 1265 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1997.

    Google Scholar 

  55. J. Dix, L. Pereira, and T. Przymusinski, editors. Non-Monotonic Extensions of Logic Programming, Proceedings, volume 927 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1995.

    Google Scholar 

  56. J. Dix, L. Pereira, and T. Przymusinski, editors. Non-Monotonic Extensions of Logic Programming, Proceedings, volume 1216 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1997.

    Google Scholar 

  57. F. M. Donini, B. Hollunder, M. Lenzerini, A. M. Spaccamela, D. Nardi, and W. Nutt. The complexity of existential quantification in concept languages. Journal of Artificial Intelligence, 53:309–327, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  58. F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), pages 151–162, Cambridge, Mass., 1991. Morgan Kaufmann, San Francisco.

    Google Scholar 

  59. F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. Tractable concept languages. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 458–463, Sydney, Australia, 1991. Morgan Kaufmann, San Francisco.

    Google Scholar 

  60. F. M. Donini, M. Lenzerini, D. Nardi, W. Nutt, and A. Schaerf. Adding epistemic operators to concept languages. In B. Nebel, Ch. Rich, and W. Swartout, editors, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pages 342–356, Cambridge, Mass., 1992. Morgan Kaufmann, San Francisco.

    Google Scholar 

  61. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Deduction in concept languages: From subsumption to instance checking. Journal of Logic and Computation, 4(4):423–452, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  62. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In G. Brewka, editor, Principles of Knowledge Representation, pages 191–236. CSLI Publications, Stanford (CA), USA, 1996.

    Google Scholar 

  63. W. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B. Elsevier, Amsterdam, The Netherlands, 1990.

    Google Scholar 

  64. M. Fattorosi-Barnaba and F. de Caro. Graded modalities I. Studia Logica, 44:197–221. 1985.

    Article  MathSciNet  MATH  Google Scholar 

  65. C. Fernmüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem, volume 679 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1993.

    Google Scholar 

  66. K. Fine. In so many possible worlds. Notre Dame Journal of Formal Logics, 13:516–520, 1972.

    Article  MathSciNet  MATH  Google Scholar 

  67. M. J. Fischer and R. E. Ladner. Propositional modal logic of programs. In Ninth Annual ACM Symposium on Theory of Computing, pages 286–294, New York, N.Y., 1977. ACM.

    Google Scholar 

  68. M. Fitting. Basic modal logic. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 1. Oxford University Press, Oxford, UK, 1993.

    Google Scholar 

  69. D. M. Gabbay. Theoretical foundations for non-monotonic reasoning in expert systems. In K. R. Apt, editor, Proceedings of the NATO Advance Study Institute on Logics and Models of Concurrent Systems, La Colle-sur-Loup, France, 1985. Springer-Verlag.

    Google Scholar 

  70. D. M. Gabbay. Modal and temporal logic programming. In A. Galton, editor, Temporal Logics and Their Applications. Academic Press, London, UK, 1987.

    Google Scholar 

  71. D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3; Nonmonotonic Reasoning. and Uncertain Reasoning. Oxford University Press, Oxford, UK, 1994.

    MATH  Google Scholar 

  72. G. Gargov and V. Goranko. Modal logic with names. J. Philosophical Logic, 22:607–636, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  73. M. Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 12(1–2):89–116, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  74. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Symposium on Logic Programming, pages 1070–1080, Cambridge, MA., 1988. MIT Press.

    Google Scholar 

  75. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D. Warren and P. Szeredi, editors, Proceedings of the 7th International Conference on Logic Programming, pages 579–597, Cambridge, MA, 1990. MIT Press.

    Google Scholar 

  76. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.

    Article  MATH  Google Scholar 

  77. G. De Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), pages 205–212. AAAI-Press/The MIT-Press, 1994.

    Google Scholar 

  78. G. De Giacomo and M. Lenzerini. Concept languages with number restrictions and fixpoints, and its relationship with mu-calculus. In A. G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI-94), pages 411–415. John Wiley and Sons, 1994.

    Google Scholar 

  79. G. De Giacomo and M. Lenzerini. TBox and ABox reasoning in expressive description logics. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), pages 316–327, Cambridge, Mass., 1996. Morgan Kaufmann, San Francisco.

    Google Scholar 

  80. M. L. Ginsberg, editor. Readings in Nonmonotonic Reasoning. Morgan Kaufmann, San Francisco, 1987.

    Google Scholar 

  81. L. Giordano and A. Martelli. Structuring logic programs: A modal approach. Journal of Logic Programming, 21(2):59–94, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  82. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchell. More evaluation of decision procedures for modal logics. In A. Cohn, L. Schubert, and S. Shapiro, editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 626–635, Trento, Italy, 1998. Morgan Kaufmann, San Francisco.

    Google Scholar 

  83. F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for . In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR-96), pages 304–314, Cambridge, Mass., 1996. Morgan Kaufmann, San Francisco.

    Google Scholar 

  84. E. Grädel. On the restraining power of guards. J. Symbolic Logic, 1998. To appear.

    Google Scholar 

  85. E. Grädel, P. G. Kolaitis, and M. Y. Vardi. On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic, 3(1):53–69, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  86. E. Grädel, M. Otto, and E. Rosen. Two-variable logic with counting is decidable. In G. Winskel, editor, Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), pages 306–317, Warsaw, Poland, 1997. IEEE Computer Society Press.

    Google Scholar 

  87. V. Haarslev, C. Lutz, and R. Möller. Foundations of spatioterminological reasoning with description logics. In A, Cohn, L. Schubert, and S. Shapiro, editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 112–123, Trento, Italy, 1998. Morgan Kaufmann, San Francisco.

    Google Scholar 

  88. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logic of knowledge and belief. Journal of Artificial Intelligence, 54:319–379, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  89. P. Hanschke. Specifying role interaction in concept languages. In B. Nebel, Ch. Rich, and W. Swartout, editors, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pages 318–329, Cambridge, Mass., 1992. Morgan Kaufmann, San Francisco.

    Google Scholar 

  90. P. Hanschke. A Declarative Integration of Terminological, Constraint-based, Data-driven, and Goal-directed Reasoning, volume 122 of DISKI. Infix, Sankt Augustin, Germany, 1996.

    Google Scholar 

  91. P. J. Hayes. In defence of logic. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, IJCAI’77, pages 559–565, Cambridge, Mass., 1977.

    Google Scholar 

  92. P. J. Hayes. The logic of frames. In D. Mentzing, editor, Frame Conceptions and Text Understanding. Walter de Gruyter and Co., Berlin, Germany, 1979.

    Google Scholar 

  93. B. Hollunder. Hybrid inferences in KL-ONE-based knowledge representation systems. In 14th German Workshop on Artificial Intelligence, volume 251 of Informatik-Fachberichte, pages 38–47, Ebingerfeld, Germany, 1990. Springer-Verlag.

    Article  Google Scholar 

  94. B. Hollunder and F. Baader. Qualifying number restrictions in concept languages. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the 2nd Inter national Conference on Principles of Knowledge Representation and Reasoning, pages 335–346, Cambridge, Mass., 1991. Morgan Kaufmann, San Francisco.

    Google Scholar 

  95. B. Hollunder, W. Nutt, and M. Schmidt-Schauß. Subsumption algorithms for concept description languages. In L. C. Aiello, editor, Proceedings of the 9th European Conference on Artificial Intelligence (ECAI-90), pages 348–353, Stockholm, Sweden, 1990. Pitman Publishing, London.

    Google Scholar 

  96. T. Hoppe, C. Kindermann, J. Quantz, A. Schmiedel, and M. Fischer. BACK V5: tutorial and manual. KIT Report 100, Technical University of Berlin, Berlin, Germany, 1993.

    Google Scholar 

  97. I. Horrocks. Optimizing Tableaux Decision Procedures for Description Logics. Ph.D. thesis, University of Manchester, Manchester, UK, 1997.

    Google Scholar 

  98. I. Horrocks. Using an expressive Description Logic: FaCT or fiction? In A. Cohn, L. Schubert, and S. Shapiro, editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 636–647, Trento, Italy, 1998. Morgan Kaufmann, San Francisco.

    Google Scholar 

  99. I. Horrocks and G. Gough. Description logics with transitive roles. In Proceedings of the 1997 International Workshop on Description Logics (DL-97), pages 25–28, Gif sur Yvette, France, 1997. LRI, Université Paris-Sud.

    Google Scholar 

  100. I. Horrocks and P. F. Patel-Schneider. Optimising propositional modal satisfiability for description logic subsumption. In J. Calmet and J. Plaza, editors, Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation (AISC-98), volume 1476 of Lecture Notes in Artificial Intelligence, pages 234–246. Springer-Verlag, 1998.

    Google Scholar 

  101. I. Horrocks and U. Sattler. A description logic with transitive and converse roles and role hierarchies. In Proceedings of the 1998 International Workshop on Description Logics (DL-98), pages 72–81, Povo-Trento, Italy, 1998. ITC-irst Report 9805-03.

    Google Scholar 

  102. G. E. Hughes and M. J. Cresswell. A Companion to Modal Logic. Methuen & Co., London, 1984.

    MATH  Google Scholar 

  103. U. Hustadt and R. A. Schmidt. On evaluating decision procedures for modal logics. In M. Pollack, editor, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI’97), volume 1, pages 202–207. Morgan Kaufmann, 1997.

    Google Scholar 

  104. U. Hustadt and R. A. Schmidt. Simplification and backjumping in modal tableau. In H. Swart, editor, Proceedings of TABLEAUX’98, volume 1397 of Lecture Notes in Computer Science, pages 187–201. Springer-Verlag, 1998.

    Google Scholar 

  105. T. Imielinski. Results on translating defaults to circumscription. Journal of Artificial Intelligence, 32(1):131–146, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  106. A. Kobsa. First experiences with the SB-ONE knowledge representation work bench in natural language applications. SIGART Bulletin, 2(3):70–76, 1991.

    Article  Google Scholar 

  107. J. Koehler. An application of terminological logics to case-based reasoning. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proceedings of the Fourth Inter national Conference on Principles of Knowledge Representation and Reasoning (KR-94), pages 351–362, Bonn, Germany, 1994. Morgan Kaufmann, San Francisco.

    Chapter  Google Scholar 

  108. K. Konolige. On the relation between default and autoepistemic logic. Journal of Artificial Intelligence, 35(3):343–382, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  109. K. Konolige. On the relation between circumscription and autoepistemic logic. In N. S. Sridharan, editor, Proceedings of the 11th International Joint Conference on Artificial Intelligence, IJCAI-89, pages 1213–1218, Detroit, MI, 1989. Morgan Kaufmann, San Francisco.

    Google Scholar 

  110. R. A. Kowalski. Logic for knowledge representation. In M. Joseph and R. Shyamasundar, editors, Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science, pages 1–12, 1984.

    Google Scholar 

  111. S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Journal of Artificial Intelligence, 44(1–2):167–207, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  112. R. Küsters. Characterizing the semantics of terminological cycles in ALN using finite automata. In A. Cohn, L. Schubert, and S. Shapiro, editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 499–510, Trento, Italy, 1998. Morgan Kaufmann, San Francisco.

    Google Scholar 

  113. A. Laux. Beliefs in multi-agent worlds: A terminological logics approach. In A. G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI-94). John Wiley and Sons, 1994.

    Google Scholar 

  114. D. Lehmann. What a conditional knowledge base entails. In R. J. Brachman, editor, Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 212–222, Toronto, Ont., 1989.

    Google Scholar 

  115. H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3:78–93, 1987.

    Article  MATH  Google Scholar 

  116. A. Levy and M.-C. Rousset. Verification of knowledge bases based on containment checking. Journal of Artificial Intelligence, 101:227–256, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  117. A. Levy and M.C. Rousset. CARIN: A representation language combining Horn rules and description logics. In W. Wahlster, editor, Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI-96), pages 323–327. John Wiley & Sons Ltd, 1996.

    Google Scholar 

  118. V. Lifschitz. Between circumscription and autoepistemic logic. In R. J. Brachman, editor, Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 235–244, Toronto, Ont., 1989.

    Google Scholar 

  119. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. MIT-Press, 1992.

    Google Scholar 

  120. W. Lukaszewicz. Non-Monotonic Reasoning. Ellis Horwood Series in Artificial Intelligence, 1992.

    Google Scholar 

  121. R. MacGregor. Inside the LOOM classifier. SIGART Bulletin, 2(3):88–92, 1991.

    Article  Google Scholar 

  122. R. MacGregor and R. Bates. The LOOM knowledge representation language. Technical Report ISI/RS-87-188, University of Southern California, 1987.

    Google Scholar 

  123. D. Makinson. General theory of cumulative inference. In M. Reinfrank, J. de Kleer, M. L. Ginsberg, and E. Sandewall, editors, Proceedings of the 2nd International Workshop on Non-monotonic Reasoning, volume 346 of Lecture Notes in Artificial Intelligence, pages 1–18, Grassau, Germany, 1989. Springer-Verlag.

    Google Scholar 

  124. D. Makinson. General patterns in nonmonotonic reasoning. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3: Nonmonotonic and Uncertain Reasoning, pages 35–110. Oxford University Press, Oxford, UK, 1994.

    Google Scholar 

  125. V. Marek, A. Nerode, and M. Truszczynski, editors. Logic Programming and Nonmonotonic Reasoning, Third International Conference, volume 928 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1995.

    Google Scholar 

  126. V. M. Marek and M. Truszczyński. Nonmonotonic Logics; Context-Dependent Reasoning. Springer-Verlag, Berlin-Heidelberg-New York, 1993.

    MATH  Google Scholar 

  127. E. Mays, C. Apté, J. Griesmer, and J. Kastner. Experience with K-Rep: An object-centered knowledge representation language. In Proceedings of IEEE CAIA-88, pages 62–67, 1988.

    Google Scholar 

  128. E. Mays, R. Dionne, and R. Weida. K-Rep system overview. SIGART Bulletin, 2(3):93–97, 1991.

    Article  Google Scholar 

  129. J. McCarthy. Circumscription — A form of non-monotonic reasoning. Journal of Artificial Intelligence, 13(1–2):27–39, 1980.

    Article  MATH  Google Scholar 

  130. J. McCarthy and P. J. Hayes. Some philosophical problems from the standpoint of AI. Machine Intelligence, 4:463–502, 1969. Reprinted in Readings in Knowledge Representation, R. J. Brachman and H. J. Levesque (editors), Morgan Kaufman, 1985.

    MATH  Google Scholar 

  131. D. McDermott. Nonmonotonic logic II: Nonmonotonic modal theories. Journal of the ACM, 29(1):33–57, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  132. D. McDermott and J. Doyle. Non-monotonic logic I. Journal of Artificial Intelligence, 29(1):33–57, 1982.

    MATH  Google Scholar 

  133. D. L. McGuinness, L. Alperin Resnick, and C. Isbell. Description Logic in practice: A Classic application. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, IJCAI’95, pages 2045–2046, Montreal, Canada, 1995. Morgan Kaufmann, San Francisco. Video Presentation.

    Google Scholar 

  134. J. Minker. An overview of nonmonotonic reasoning and logic programming. Journal of Logic Programming, 17:95–126, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  135. M. Minsky. A framework for representing knowledge. In P. Winston, editor, The Psychology of Computer Vision. McGraw-Hill, New York, 1975.

    Google Scholar 

  136. R. C. Moore. Semantical considerations on nonmonotonic logic. Journal of Artificial Intelligence, 25(1):75–94, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  137. M. Mortimer. On languages with two variables. Zeitschr. f. math. Logik und Grundlagen d. Math., 21:135–140, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  138. B. C. Moszkowski. Executing Temporal Logic Programs. Cambridge University Press, Cambridge, UK, 1986.

    MATH  Google Scholar 

  139. B. Nebel. Computational complexity of terminological reasoning in BACK. Journal of Artificial Intelligence, 34(3):371–383, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  140. B. Nebel. Terminological cycles: Semantics and computational properties. In J. Sowa, editor, Principles of Semantic Networks, pages 331–362. Morgan Kaufmann, San Francisco, 1989.

    Google Scholar 

  141. B. Nebel. Reasoning and Revision in Hybrid Representation Systems, volume 422 of Lecture Notes in Computer Science. Springer-Verlag, 1990.

    MATH  Google Scholar 

  142. B. Nebel. Terminological reasoning is inherently intractable. Journal of Artificial Intelligence, 43(2):235–249, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  143. B. Nebel and K. von Luck. Hybrid reasoning in BACK. In Z. W. Ras and L. Saitta, editors, Methodologies for Intelligent Systems, volume 3, pages 260–269. North-Holland, 1988.

    Google Scholar 

  144. L. Pacholski, W. Szwast, and L. Tendera. Complexity of two-variable logic with counting. In G. Winskel, editor, Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), pages 318–327, Warsaw, Poland, 1997. IEEE Computer Society Press.

    Google Scholar 

  145. R. Parikh. Propositional dynamic logics of programs: A survey. In E. Engeler, editor, Proceedings of the Workshop on Logic of Programs, volume 125 of LNCS, pages 102–144, Zürich, Switzerland, 1979. Springer-Verlag.

    Chapter  Google Scholar 

  146. P. F. Patel-Schneider. A four-valued semantics for terminological logics. Journal of Artificial Intelligence, 38(3):319–351, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  147. P. F. Patel-Schneider. Undecidability of subsumption in NIKL. Journal of Artificial Intelligence, 39(2):263–272, 1989.

    Article  MathSciNet  Google Scholar 

  148. P. F. Patel-Schneider. DLP system description. In Proceedings of the 1998 International Workshop on Description Logic (DL-98), pages 87–89, Trento, Italy, 1998. ITC-irst Report 9805-03.

    Google Scholar 

  149. C. Peltason. The BACK system — an overview. SIGART Bulletin, 2(3):114–119, 1991.

    Article  Google Scholar 

  150. T. Przymusinski. Non-monotonic formalisms and logic programming. In Proceedings of the 6th International Conference on Logic Programming, pages 655–674, Cambridge, MA, 1989. MIT Press.

    Google Scholar 

  151. T. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.

    Article  MATH  Google Scholar 

  152. J. Quantz, G. Dunker, and V. Royer. Flexible inference strategies for DL systems. In Proceedings of the 1994 International Workshop on Description Logic (DL-94), pages 27–30, Bonn, Germany, 1994. DFKI Document D-94-10, DFKI, Saarbrücken (Germany).

    Google Scholar 

  153. J. Quantz and V. Royer. A preference semantics for defaults in terminological logics. In B. Nebel, Ch. Rich, and W. Swartout, editors, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pages 294–305, Cambridge, Mass., 1992. Morgan Kaufmann, San Francisco.

    Google Scholar 

  154. J. Quantz and B. Schmitz. Knowledge-based disambiguation for machine translation. Minds and Machines, 4:39–57, 1994.

    Article  Google Scholar 

  155. M. Quillian. Semantic memory. In M. Minsky, editor, Semantic Information Processing, pages 216–270. MIT Press, Cambridge, Mass., 1968.

    Google Scholar 

  156. R. Reiter. On closed world data bases. In Logic and Data Bases, pages 55–76. Plenum Press, New York, 1978.

    Chapter  Google Scholar 

  157. Raymond Reiter. A logic for default reasoning. Journal of Artificial Intelligence, 13:81–132, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  158. N. Rychtyckyj. DLMS: An evaluation of KL-ONE in the automobile industry. In L. C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96), pages 588–596, Cambridge, Mass., 1996. Morgan Kaufmann, San Francisco.

    Google Scholar 

  159. U. Sattler. A concept language extended with different kinds of transitive roles. In G. Görz and S. Hölldobler, editors, 20. Deutsche Jahrestagung für Künstliche Intelligenz, KI’97, volume 1137 of Lecture Notts in Artificial Intelligence. Springer-Verlag, 1996.

    Google Scholar 

  160. A. Schaerf. On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2:265–278, 1993.

    Article  Google Scholar 

  161. K. Schild. A correspondence theory for terminological logics: Preliminary report. In J. Mylopoulos and R. Reiter, editors, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 466–471, Sydney, Australia, 1991. Morgan Kaufmann, San Francisco.

    Google Scholar 

  162. K. Schild. Combining terminological logics with tense logic. In M. Filgueiras and L. Damas, editors, Progress in Artificial Intelligence — 6th Portuguese Conference on Artificial Intelligence, EPIA’ 93, Lecture Notes in Artificial Intelligence, pages 105–120, Porto, Portugal, 1993. Springer-Verlag.

    Google Scholar 

  163. K. Schild. Terminological cycles and the propositional μ-calculus. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR’ 94), pages 509–520, Bonn, Germany, 1994. Morgan Kaufmann, San Francisco.

    Chapter  Google Scholar 

  164. R. A. Schmidt. Resolution is a decision procedure for many propositional modal logics. In M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, editors, Advances in Modal Logic, volume 87 of CSLI Lecture Notes, pages 189–208. CSLI Publications, Stanford, Cal., 1998.

    Google Scholar 

  165. M. Schmidt-Schauß. Subsumption in KL-ONE is undecidable. In R. J. Brachman, editor, Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pages 421–431, Toronto, Ont., 1989. Morgan Kaufmann, San Francisco.

    Google Scholar 

  166. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Journal of Artificial Intelligence, 47:1–26, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  167. L. K. Schubert, R. G. Goebel, and N. J. Cercone. The structure and organization of a semantic net for comprehension and inference. In N. V. Findler, editor, Associative Networks: Representation and Use of Knowledge by Computers, pages 121–175. Academic Press, 1979.

    Google Scholar 

  168. J. C. Shepherdson. Negation as failure: A comparison of Clark’s completed database and Reiter’s closed world assumption. J. Logic Programming, 1(15):51–79, 1984.

    Article  MATH  Google Scholar 

  169. Y. Shoham. A semantical approach to nonmonotonic logics. In IEEE Symposium on Logic in Computer Science, pages 275–279, Ithaca, N.Y., 1987.

    Google Scholar 

  170. R. M. Smullyan. First-Order Logic, volume 43 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, Berlin, Heidelberg, New York, 1968.

    Book  MATH  Google Scholar 

  171. C. Stirling. Modal and temporal logic. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, Vol. 2. Oxford University Press, Oxford, UK, 1993.

    Google Scholar 

  172. W. van der Hoek and M. de Rijke. Counting objects. J. Logic and Computation, 5(3):325–345, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  173. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38:620–650, 1991.

    MathSciNet  MATH  Google Scholar 

  174. M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logic of programs. Journal of Computer and System Sciences, 32:183–221, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  175. F. Wolter and M. Zakharyaschev. Satisfiability problems in description logics with modal operators. In A. Cohn, L. Schubert, and S. Shapiro, editors, Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pages 512–523, Trento, Italy, 1998. Morgan Kaufmann, San Francisco.

    Google Scholar 

  176. W. A. Woods. What’s in a link: foundations for semantic networks. In D. G. Bobrow and A. M. Collins, editors, Representation and Understanding: Studies in Cognitive Science, pages 35–82. Academic Press, London, 1975.

    Chapter  Google Scholar 

  177. W. A. Woods and J. G. Schmolze. The KL-ONE family. Computers and Mathematics with Applications, 23(2–5):133–177, 1992.

    Article  MATH  Google Scholar 

  178. J. R. Wright, E. S. Weixelbaum, K. Brown, G. T. Vesonder, S. R. Palmer, J. I. Berman, and H. H. Moore. A knowledge-based configurator that supports sales, engineering, and manufacturing at AT&T network systems. AI Magazine, 14(3):69–80, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science, RWTH Aachen, 52074, Aachen, Germany

    Franz Baader

Authors
  1. Franz Baader
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronic Engineering, Queen Mary and Westfield College, University of London, London, E1 4NS, UK

    Michael J. Wooldridge

  2. Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Manuela Veloso

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Baader, F. (1999). Logic-Based Knowledge Representation. In: Wooldridge, M.J., Veloso, M. (eds) Artificial Intelligence Today. Lecture Notes in Computer Science(), vol 1600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48317-9_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-48317-9_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66428-4

  • Online ISBN: 978-3-540-48317-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation