632 search results - page 13 / 127 » constraints 2000 |
INFSOF
2000
13 years 7 months ago
2000
Semantic query optimization is the process of utilizing information implied by integrity constraints to reformulate the query into one that generates the same set of answers in a ...
ACL
2000
13 years 9 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
IPL
2000
13 years 7 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
IPL
2000
13 years 7 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...