CITI has stopped operations in 2014, to co-launch NOVA LINCS THIS SITE IS NOT BEING UPDATED SINCE 2013
citi banner
Home Page FCT/UNL UNL
  Home  \  Publications  \  InProceedings Page Login  
   
banner bottom
File Top
The Retrieval Problem in a Concept Language with Number Restrictions
Abstract:

In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [mm93a], 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.


@ Progress in Artificial Intelligence: Proceedings of the 7th Portuguese Conference on Artificial Intelligence


Editors: Carlos Pinto-Ferreira and Nuno J. Mamede

Series: Lecture Notes in Artificial Intelligence

Number: 990

Publisher: Springer-Verlag ( Germany )

Pages: 69 to 82


Date: October, 1995


Authors:

File Bottom