27 search results - page 1 / 6 » Pragmatics and Open Problems for Inter-schema Constraint The... |
ICDE
2006
IEEE
13 years 10 months ago
2006
IEEE
We consider pragmatic issues in applying constraint-based theories (such as that developed for data exchange) to a variety of problems. We identify disconnects between theoreticia...
POPL
2002
ACM
14 years 4 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
WSC
1998
13 years 5 months ago
1998
A significant challenge in implementing the Theory of Constraints in the semiconductor industry is the complex and reentrant nature of the manufacturing process. Managing a constr...
AGP
1999
IEEE
13 years 8 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
MFCS
2001
Springer
13 years 8 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...