73 search results - page 8 / 15 » Tight Bounds on the Descriptional Complexity of Regular Expr... |
SEBD
2007
13 years 9 months ago
2007
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
DATE
1999
IEEE
13 years 11 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
JACM
2010
13 years 6 months ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
DBPL
2001
Springer
14 years 3 hour ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
WIA
2000
Springer
13 years 11 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...