Abstract
In this paper, we study the retrieval problem in \(\mathcal{A}\mathcal{L}\mathcal{N}\), which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs from the classical framework in two respects. First, the definition of answer has been extended in order to refer to elements whose existence may be deduced but have no explicit representation in the knowledge base. Therefore, our answers are also more informative than the classical ones. Second, the query-answering algorithm is syntax-directed rather than of the generate-and-test sort. Due to number restrictions, answers are possibly infinite sets but, since they are regular languages, they are described by regular expressions. The query-answering algorithm relies on a finite automaton, which can be seen as a preprocessing of the knowledge base, because it is built from its completion and does not depend on the query. Both a declarative and an operational semantics are described, and proved to be equivalent.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Baader, B. Hollunder. KRIS: Knowledge Representation and Inference System. SIGART Bulletin, 2(3):8–14, 1991.
F. Baader, B. Hollunder. A Terminological Knowledge Representation System with Complete Inference Algorithms. In Proc. International Workshop on Processing Declarative Knowledge (PDK'91), Kaiserslautern, H. Boley and M. M. Richter (eds.), LNAI 567, Springer-Verlag, 1991.
R. Brachman, R. Fikes, H. Levesque. KRYPTON: A Functional Approach to Knowledge Representation. In Readings in Knowledge Representation, R. Brachman and H. Levesque (eds.), Morgan Kaufmann, 1985.
R. Brachman, H. Levesque. The Tractability of Subsumption in Frame-Based Description Languages. In Proc. 4th National Conference on Artificial Intelligence (AAAI'84), Austin, Texas, 1984.
M. Buchheit, F. Donini, A. Schaerf. Decidable Reasoning in Terminological Knowledge Representation Systems. In Proc. 13th International Joint Conference on Artificial Intelligence (IJCAI'93), Chambéry, R. Bajcsy (ed.), Morgan Kaufmann, 1993.
W. Cohen, H. Hirsh. Learning the CLASSIC Description Logic: Theoretical and Experimental Results. In Proc. of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94), Bonn, J. Doyle, E. Sandewall and P. Torasso (eds.), Morgan Kaufmann, 1994.
F. Donini, M. Lenzerini, D. Nardi, W. Nutt. The Complexity of Concept Languages. In Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR '91), Cambridge, MA, J. A. Allen, R. Fikes and E. Sandewall (eds.), Morgan Kaufmann, 1991.
F. Donini, M. Lenzerini, D. Nardi, W. Nutt. Tractable Concept Languages. In Proc. 12th International Joint Conference on Artificial Intelligence (IJCAI'91), Sidney, J. Mylopoulos and R. Reiter (eds.), Morgan Kaufmann, 1991.
F. Donini, M. Lenzerini, D. Nardi, A. Schaerf. Deduction in Concept Languages: from Subsumption to Instance Checking. Journal of Logic and Computation, 4(4):423–452, 1994.
M. Lenzerini, A. Schaerf. Querying Concept-based Knowledge Bases. In Proc. International Workshop on Processing Declarative Knowledge (PDK'91), Kaiserslautern, H. Boley and M. M. Richter (eds.), LNAI 567, Springer-Verlag, 1991.
R. MacGregor. Inside the LOOM Description Classifier. SIGART Bulletin, 2(3):88–92, 1991.
M. Mamede, L. Monteiro. Towards Complete Answers in Concept Languages. In Proc. 6th Portuguese Conference on Artificial Intelligence (EPIA '93), Porto, M. Filgueiras and L. Damas (eds.), LNAI 727, Springer-Verlag, 1993.
M. Mamede, L. Monteiro. \(\mathcal{A}\mathcal{L}\mathcal{N}\)rn: A Decidable Terminological Language with Role Negation. In Proc. 6th Australian Joint Conference on Artificial Intelligence (AI'93), Melbourne, C. Rowles, H. Liu and N. Foo (eds.), World Scientific Publishing, 1993.
M. Mamede, L. Monteiro. Towards More Informative Answers in Terminological Logics. To appear in Proc. International KRUSE Symposium — Knowledge Retrieval, Use, and Storage for Efficiency, Santa Cruz, California, August 1995.
B. Nebel. Computational Complexity of Terminological Reasoning in BACK. Artificial Intelligence, 34(3):371–383, 1988.
B. Nebel. Terminological Reasoning is Inherently Intractable. Artificial Intelligence, 43(2):235–249, 1990.
P. F. Patel-Schneider. Undecidability of Subsumption in NIKL. Artificial Intelligence, 39(2):263–272, 1989.
P. Patel-Schneider, D. McGuinness, R. Brachman, L. Resnick, A. Borgida. The CLASSIC Knowledge Representation System: Guiding Principles and Implementation Rationale. SIGART Bulletin, 2(3):108–113, 1991.
C. Peltason. The BACK System — An Overview. SIGART Bulletin, 2(3):114–119, 1991.
A. Schaerf. On the Complexity of the Instance Checking Problem in Concept Languages with Existential Quantification. In Proc. 7th International Symposium on Methodologies for Intelligence Systems (ISMIS'93), Trondheim, Norway, J. Komorowski and Z. W. Raś (eds.) LNAI 689, Springer-Verlag, 1993.
M. Schmidt-Schauß, G. Smolka. Attributive Concept Descriptions with Complements. Artificial Intelligence, 48(1):1–26, 1991.
A. Vitória. Geração de Respostas em Bases de Conhecimento Baseadas em Conceitos. M.Sc. Thesis, Universidade Nova de Lisboa, 1995 (in portuguese).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vitória, A., Mamede, M., Monteiro, L. (1995). The retrieval problem in a concept language with number restrictions. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_6
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive