A concise presentation of ITL | SpringerLink
Skip to main content
Springer Nature Link
Log in

A concise presentation of ITL

  • Conference paper
  • First Online:
Processing Declarative Knowledge (PDK 1991)

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

Included in the following conference series:

Abstract

ITL (Intensional Terminological Language) is a Prolog-based language derived from our previous work on DRL. Like LOGIN, it improves the expressive adequacy of Prolog by the introduction of a separate theory, which represents the sortal structure of the domain. This theory is linked to the object theory by a simple form of order-sorted unification. Differently from LOGIN, however, ITL sorts are not complex structures similar to KL-ONE concepts. The reason is that ITL is not based on generic descriptions: roles (we call them attributes) are represented as independent concepts, which contribute to the structure of more complex concepts through separate statements expressing necessary conditions, sufficient conditions or structural constraints. The result is a fine-grained terminological language, whose syntax resembles in some way OMEGA. Yet, differently from OMEGA, this language does not have the full power of first order logic. It has however an intensional semantics, which we consider as an important characteristic of terminological knowledge. In this paper we briefly discuss the rationale behind ITL, and present its major characteristics.

This is an extended and revised version of a paper with the same title appeared on ACM SIGART Bulletin, Special Issue on Implemented Knowledge Representation and Reasoning Systems, vol. 2, no. 3, June 1991.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Ait-Kaci, H. and Nasr, R. 1986. LOGIN: a logic programming language with built-in inheritance. Journal of Logic Programming, no. 3.

    Google Scholar 

  2. Attardi, G. and Simi, M., 1986. A description-oriented logic for building knowledge bases. Proc. of IEEE, no. 10.

    Google Scholar 

  3. Bobrow, D. G and Winograd, T., 1977. An Overview of KRL, a Knowledge Representation Language. Cognitive Science 1/77

    Google Scholar 

  4. Brachman, R. J. 1979. On the epistemological status of semantic networks. In N. Findler (ed.), Associative networks: representation and use of knowledge by computers, Academic Press.

    Google Scholar 

  5. Brachman, R. J., and Schmolze, J. G. 1985. An Overview of the KL-ONE Knowledge Representation System. Cognitive Science 9: 171–216.

    Google Scholar 

  6. Brachman, R. J., Levesque, H. J., Reiter, R. (eds.) 1989. 1st Int. Conf. on Principles of Knowledge Representation and Reasoning. Kaufmann.

    Google Scholar 

  7. Cohn, A. G. 1987. A more expressive formulation of many sorted logic. J. of Automated Reasoning, vol. 3, no. 2.

    Google Scholar 

  8. Freeman, M. W. 1982. The qua link. In J. G. Schmolze and R. J. Brachman (eds.), Proc. of the 1981 KL-ONE Workshop, pagg. 54–64, Jackson, New Hampshire, June 1982. BBN.

    Google Scholar 

  9. Frisch, A. M. 1985. An investigation into inference with restricted quantification and a taxonomic representation. SIGART Newsletter, January.

    Google Scholar 

  10. Frisch, A. M. 1989. A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning. In [6].

    Google Scholar 

  11. Guarino, N. 1988. DRL: terminologic and relational knowledge in Prolog. In Y. Kodratoff (ed.), Proc. of 8th European Conference on Artificial Intelligence (ECAI-88), Muenchen, August 1–5, 1988. Pitman.

    Google Scholar 

  12. Guarino, N. 1988. Attributes and extensional equivalence in DRL. In B. Radig and L. Saitta (eds.), Proc. of the 3rd International Symposium on Methodologies for Intelligent Systems (ISMIS-88), Torino, October 12–15, 1988. North Holland.

    Google Scholar 

  13. Guarino, N. 1989. Nature and structure of terminological knowledge: the DRL approach. Proc. of the 1st Conf. of the Italian Association for Artificial Intelligence (AI *IA), Trento.

    Google Scholar 

  14. Guarino, N. 1990. What's in a Role: towards an Ontological Foundation for Terminological Logics. Italian National Research Council, LADSEB-CNR Int. Rep. 06/90, June 1990.

    Google Scholar 

  15. Guarino, N. 1991. Concepts, Attributes, and Arbitrary Relations: Some Linguistic and Ontological Criteria for Structuring Knowledge Bases. To appear on Data and Knowledge Engineering.

    Google Scholar 

  16. Guarino, N. 1991. A Formal Account of ITL. In preparation.

    Google Scholar 

  17. Hirst, G. 1989. Ontological assumptions in knowledge representation. In [6].

    Google Scholar 

  18. Lenat, D. B., and Guha, R. V. 1990. Building Large Knowledge-Based Systems: Representation and Inference in the Cyc Project. Addison-Wesley

    Google Scholar 

  19. Maida, A. 1984. Processing Entailments and Accessing Facts in a Uniform Frame System. Proc. of AAAI-84.

    Google Scholar 

  20. Maida, A. 1987. Frame theory, in S. Shapiro (ed.), Encyclopedia of Artificial Intelligence. John Wyley.

    Google Scholar 

  21. Martin, W. A. 1979. Descriptions and the Specializations of Concepts. In Winston & Brown (ed.), AI: an MIT perspective, MIT Press.

    Google Scholar 

  22. McCarthy 1979. First order theories of individual concepts and propositions. In Machine Intelligence 9, Ellis Horwood.

    Google Scholar 

  23. Nebel, B. 1990. Reasoning and Revision in Hybrid Representation Systems. Lecture Notes in Artificial Intelligence, vol. 422, Springer Verlag.

    Google Scholar 

  24. Patel-Schneider, P. F. 1987. A hybrid, decidable, logic-based knowledge representation system. Computational Intelligence 3, pp. 64–77.

    Google Scholar 

  25. Pletat, U., von Luck, K. 1990. Knowledge Representation in LILOG. In K. H. Bläsius, U. Hedstück and C. R. Rollinger (eds.), Sorts and Types in Artificial Intelligence, Lecture Notes in Artificial Intelligence, vol. 418, Springer Verlag.

    Google Scholar 

  26. Shapiro, S.A. 1986. Symmetric relations, intensional individuals, and variable binding. Proc. of the IEEE, no. 10.

    Google Scholar 

  27. Schmitt, P.H., Wernecke, W. 1990. Tableau Calculus for Order Sorted Logic. In K. H. Bläsius, U. Hedtstück, C.-R. Rollinger (eds.), Sorts and Types in Artificial Intelligence, Lecture Notes in Artificial Intelligence, vol. 418, Springer Verlag.

    Google Scholar 

  28. Wilensky, R. 1987. Some problems and proposals for knowledge representation. University of California, Berkeley, Rep. UCB/CSD 87/351.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research Council, Institute for Systems Dynamics and Bioengineering (LADSEB-CNR), Corso Stati Uniti 4, I-35020, Padova, Italy

    Nicola Guarino

Authors
  1. Nicola Guarino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Harold Boley Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guarino, N. (1991). A concise presentation of ITL. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013526

Download citation

  • DOI: https://doi.org/10.1007/BFb0013526

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46667-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation