Una propuesta de la lógica terminológica: El lenguaje de conceptos
DOI:
https://doi.org/10.15446/ing.investig.n49.21415Keywords:
Inteligencia artificial, Concepto, Lógica terminológica, Lógica descriptiva, Lenguaje de conceptos, Subsumisión, Conceptos primitivos, Conceptos definidos, Expresión de conceptos, Rol, Interpretación, Axiomas terminológicos y aseverativos (es)Artificial intelligence, Concept, Logic terminology, Descriptive logic, Language concepts, Subsumption, Primitive concepts, Defined concepts, Expression concepts, Role, Interpretation, Axioms terminology and assertive (en)
Downloads
El presente artículo describe los lenguajes de conceptos o lógicas descriptivas (DLs: Description Logics) de la familia KLONE. Los lenguajes de conceptos permiten representar el conocimiento de un dominio por medio de conceptos y roles, donde los conceptos modelan clases de individuos y los roles especifican relaciones entre las clases. De la combinación de conceptos atómicos y roles atómicos con adecuados constructores se generan expresiones de conceptos. Los lenguajes de conceptos están dotados de la semántica declarativa al estilo de Tarski, donde los conceptos son interpretados como subconjuntos de un dominio, y los roles como relaciones binarias. La semántica de conceptos identifica los lenguajes de conceptos como fragmentos de la lógica de predicados de primer orden. El razonamiento sobre los conceptos está basado en la relación de subsumisión. Esta relación implícitamente define una taxonomía entre los conceptos.
This paper describes the concept languages or description logics (DLs) of the KL-ONE family. The concept languages allow to represent the knowledge of a domain by the concepts and roles, where the concepts model individual classes and roles determine relationships between the classes. Of the combination of atomic concepts and atomic roles with suitable constructors can be generated concept expressions. The concept languages are given a Tarski style declarative semantics where the concepts are interpreted as subsets of a domain and roles as binary relations. The semantics of concepts identifies concept languages as fragments of first order predicate logic. The reasoning over the concepts is based in the subsumption relationship. Which implicitly defines a taxonomic between the concepts.
References
Baader, F Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 1991.
Baader, F, Franconi, E., Hollunder B., Nebel B. and Profitlich H. "An empirical analysis of optimization techniques for terminological representation systems”. Applied Artificial Intelligence, 4:109-132, 1994. DOI: https://doi.org/10.1007/BF00872105
Brachman, R. A structural paradigm for representating knowledge. Ph. D. thesis, Harvard University, 1977.
Brachman, R. and Schmoize, G. “An overview of the KLONE knowledge representation system”, Cognitive Science 9(2}, 171-216, 1985. DOI: https://doi.org/10.1207/s15516709cog0902_1
Domini, F, Lenzerini, D., Nardi, D. and Nutt, W. “The Complexity of Concept Languages”. Information and Computation, 134, 1-58, 1997. DOI: https://doi.org/10.1006/inco.1997.2625
Hollunder, B and Nutt. W. Subsumption Algorithms for Concept Languages DFKI report, RR-90-04, 1990.
Horrocks, I., Optimizing Tableaux Decision Procedures for Description Logics. Ph. D. thesis, University of Manchester, 1997.
Mac Gregor, R. The evolving technology of classitication-based knowledge representation systems, Principles of semantic networks: Explorations in the representation knowledge. Morgan-Kaufman, San Mateo, 1991. DOI: https://doi.org/10.1016/B978-1-4832-0771-1.50021-7
Schild, K. A Correspondence Theory for Terminological Logics: Preliminary Report, In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 466-471, 1991.
Schmidt-Schaub, M. and Smolka, G., “Attributive concept descriptions with union and complements". Artificial Intelligence, 47, 1991. DOI: https://doi.org/10.1016/0004-3702(91)90078-X
Woods, W., and Schmolze, J. “The KL-ONE Family”. Computers and Mathematics with Aplications, Vol. 23, No. 2-5:133-177, 1992. DOI: https://doi.org/10.1016/0898-1221(92)90139-9
How to Cite
APA
ACM
ACS
ABNT
Chicago
Harvard
IEEE
MLA
Turabian
Vancouver
Download Citation
License
Copyright (c) 2002 Luis Ignacio Lizcano Bueno, Luis Roberto Ojeda Ch.
This work is licensed under a Creative Commons Attribution 4.0 International License.
The authors or holders of the copyright for each article hereby confer exclusive, limited and free authorization on the Universidad Nacional de Colombia's journal Ingeniería e Investigación concerning the aforementioned article which, once it has been evaluated and approved, will be submitted for publication, in line with the following items:
1. The version which has been corrected according to the evaluators' suggestions will be remitted and it will be made clear whether the aforementioned article is an unedited document regarding which the rights to be authorized are held and total responsibility will be assumed by the authors for the content of the work being submitted to Ingeniería e Investigación, the Universidad Nacional de Colombia and third-parties;
2. The authorization conferred on the journal will come into force from the date on which it is included in the respective volume and issue of Ingeniería e Investigación in the Open Journal Systems and on the journal's main page (https://revistas.unal.edu.co/index.php/ingeinv), as well as in different databases and indices in which the publication is indexed;
3. The authors authorize the Universidad Nacional de Colombia's journal Ingeniería e Investigación to publish the document in whatever required format (printed, digital, electronic or whatsoever known or yet to be discovered form) and authorize Ingeniería e Investigación to include the work in any indices and/or search engines deemed necessary for promoting its diffusion;
4. The authors accept that such authorization is given free of charge and they, therefore, waive any right to receive remuneration from the publication, distribution, public communication and any use whatsoever referred to in the terms of this authorization.