Representing domain structure of many-sorted Prolog knowledge bases

  • Nicola Guarino
Part 2: Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 306)


After a brief introduction on the necessity of an explicit domain description for logic knowledge bases and the advantages of many-sorted logics, we argue that domain representation may consist of a separate logic theory which allows sorts to be assigned and tested dynamically. Then we show how this theory may be used by a meta-interpreter to implement many-sorted unification. Moreover we introduce a way for structuring the domain of discourse in a semantic network, leading to a system where domain knowledge and object language assertions are conceptually distinguished but embedded within an homogeneous formalism, which we call DRL (Declarative Representation Language). We call the former terminologic knowledge and the latter assertional knowledge, showing how some of the ideas of knowledge representation systems like KRYPTON can be successfully introduced within a logic programming approach.


Semantic Network Unification Algorithm Predicate Symbol Unit Clause Closed World Assumption 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Brachman, R.J., Fikes, R.E., Levesque, H.J. (1983). KRYPTON: a functional approach to knowledge representation, Fairchild Laboratory for Artificial Intelligence Research, technical report no. 16Google Scholar
  2. Brachman, R.J., Schmolze, J. G. (1985). An overview of the KL-ONE knowledge representation system, Cognitive Science 9(2).Google Scholar
  3. Brachman, R.J., Gilbert, V.P., Levesque, H.J. (1985). An essential hybrid reasoning system: knowledge and symbol level accounts of KRYPTON, Proc. of IJCAI, Los Angeles.Google Scholar
  4. Frisch, A.M. (1985). An investigation into inference with restricted quantification and a taxonomic representation, SIGART newsletter, n. 1.Google Scholar
  5. Guarino, N. (1987) Terminologic and assertional knowledge within Prolog knowledge bases, in preparation.Google Scholar
  6. Hayes, P.J. (1979). The logic of frames, in D. Metzing (ed.), Frame conceptions and text understanding, Walter de Gruyter and Co., Berlin.Google Scholar
  7. Kleene (1967). Introduction to mathematical logic, John Wiley, New York.Google Scholar
  8. Kowalski, R. (1979). Logic for problem solving. North Holland.Google Scholar
  9. Levesque, H.J. (1984a). Foundations of a functional approach to knowledge representation, Artificial Intelligence 23 (2)Google Scholar
  10. Levesque, H.J. (1984b). A logic of implicit and explicit belief. Fairchild Technical Report No. 653.Google Scholar
  11. Logicware inc., Toronto and SzKI, Budapest (1985). MProlog reference manual.Google Scholar
  12. McCarthy, J. (1979). First order theories of individual concepts and propositions, Machine Intelligence 9, Ellis Horwood, New York.Google Scholar
  13. McSkimin, J., Minker, J. (1979). A predicate calculus based semantic network for deductive searching, in N. V. Findler (ed.), Associative Networks: representation and use of knowledge by computers, Academic Press.Google Scholar
  14. Moore, R.C. (1982). The role of logic in knowledge representation and commonsense reasoning. Proceedings of AAAI-82, Pittsburgh.Google Scholar
  15. Newell, A. (1981). The knowledge level, AI Magazine 2 (2).Google Scholar
  16. Shapiro, S.A. (1986). Symmetric relations, intensional individuals, and variable binding. Proceedings of the IEEE, 74 (10).Google Scholar
  17. Sowa, J.F. (1984). Conceptual structures: information processing in mind and in machine, Addison-Wesley.Google Scholar
  18. Stickel, M.E. (1986a). Schubert's steamroller problem: formulations and solutions, Journal of automated reasoning 2 (2).Google Scholar
  19. Stickel, M.E. (1986b). An introduction to automated deduction. In W. Bibel and Ph. Jorrand (eds.), Fundamentals of artificial intelligence, Springer Verlag.Google Scholar
  20. Walther, C. (1983). A many-sorted calculus based on resolution and paramodulation. Proceedings of IJCAI-83, Karlsruhe.Google Scholar
  21. Walther, C. (1984). Unification in many-sorted theories. Proc. of 6th ECAI, Pisa.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Nicola Guarino
    • 1
  1. 1.Ladseb-CNRPadova

Personalised recommendations