We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...