6 search results - page 1 / 2 » Linearly Bounded Reformulations of Unary Databases |
SARA
2000
Springer
13 years 8 months ago
2000
Springer
CL
2000
Springer
13 years 9 months ago
2000
Springer
PODS
2001
ACM
14 years 5 months ago
2001
ACM
The paper investigates XML document speci cations with DTDs and integrity constraints, such as keysand foreign keys. We study the consistency problem of checking whether a given s...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
4OR
2006
13 years 5 months ago
2006
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...