We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
Susan B. Davidson, Wenfei Fan, Carmem S. Hara, Jin...
Metadata development can be challenging because the vocabulary should be flexible and extensible, widely applicable, interoperable, and both machine and human readable. We describ...
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constr...
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...