Czasopismo
2001
|
Vol. 47, nr 1,2
|
53-73
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Abstrakty
In this paper we consider how constraint-based technology can be used to query semistructured data. As many concerns in semistructured data (e.g., representing and retrieving) are also found in computational linguistics, this last area could provide an interesting angle to attack some of the problems regarding semistructured data. We present a formalism based on feature logics1 for querying semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics based on the notion of extended active domain.
Czasopismo
Rocznik
Tom
Strony
53-73
Opis fizyczny
bibliogr. 53 poz.
Twórcy
autor
autor
autor
- Department of Computer Science, Purdue University, West Lafayette, IN 47907 USA, mshacid@cs.purdue.edu
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0003-0056