Paper Info
Title
The Retrieval Problem in a Concept Language with Number Restrictions
Abstract
In this paper, we study the retrieval problem inALN, which is a tractable concept language with number restrictions. Following the approach proposed in (12), this work diers 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.
Year
DOI
Venue
1995
10.1007/3-540-60428-6_6
EPIA '89
Keywords
Field
DocType
concept language,number restrictions,retrieval problem,knowledge base,regular language,finite automaton,operational semantics,regular expression
Data mining,Operational semantics,Context-sensitive language,Regular expression,Nondeterministic finite automaton,Question answering,Algebra,Deterministic finite automaton,Computer science,Theoretical computer science,Regular grammar,Regular language
Conference
ISBN
Citations 
PageRank 
3-540-60428-6
0
0.34
References 
Authors
19
3
Name
Order
Citations
PageRank
Aida Vitória1607.18
Margarida Mamede2406.46
Luís Monteiro312619.98