41 search results - page 4 / 9 » cl 2000 |
CL
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
CL
2000
Springer
13 years 10 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
CL
2000
Springer
13 years 10 months ago
2000
Springer
We propose a general scheme for the cooperation of different constraint solvers. A uniform interface for constraint solvers allows to formally specify information exchange between...
CL
2000
Springer
13 years 9 months ago
2000
Springer
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
CL
2000
Springer
13 years 9 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...