305 search results - page 36 / 61 » Decidability of Split Equivalence |
PODS
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
DBPL
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
ICS
2010
Tsinghua U.
13 years 11 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...