402 search results - page 16 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
CP
1998
Springer
13 years 11 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
KR
2010
Springer
13 years 11 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
SAS
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
ISTA
2007
13 years 9 months ago
2007
: The article is devoted to the development of knowledge-oriented models that are able to increase the efficiency and quality of main pipeline complex (MPC) dispatching control. Th...
DBPL
2001
Springer
14 years 22 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...