Full physical containment is the relation in which one physical entity is completely inside another. It is central to the description of natural resources held in reservoirs above or below the surface. Previous ontological representations of containment are located in abstract space, incomplete, or insufficiently incorporate voids, so in this paper we develop a complete taxonomy for the full co...

SPARQL query containment under schema axioms is the problem of determining whether, for any RDF graph satisfying a given set of schema axioms, the answers to a query are contained in the answers of another query. This problem has major applications for verification and optimization of queries. In order to solve it, we rely on the μ-calculus. Firstly, we provide a mapping from RDF graphs into tr...

Starting from the XQuery language we define XBind, an XML analog of relational conjunctive queries as well as a related class of XML integrity constraints (dependencies).We identify a fragment of XBind for which containment is decidable, in fact p2 -complete, and a further fragment for which containment is NP-complete. We extend the containment algorithm to take XML dependencies into account. W...

This paper presents a new solution to the containment problem for extended regular expressions that extends basic regular expressions with intersection and complement operators and consider regular expressions on infinite alphabets based on potentially infinite character sets. Standard approaches deciding the containment do not take extended operators or character sets into account. The algorit...

We reconsider the problem of containment of monadic datalog (MDL) queries in unions of conjunctive queries (UCQs). Prior work has dealt with special cases, but has left the precise complexity characterization open. We begin by establishing a 2EXPTIME lower bound on the MDL/UCQ containment problem, resolving an open problem from the early 90’s. We then present a general approach for getting tigh...

XML schemas are computer languages defining grammars for XML (Extensible Markup Languages) documents. Containment checking for XML schemas has many applications, and is thus important. Since XML schemas are related to the class of tree regular languages, their containment checking is reduced to the language containment problem for non-deterministic tree automata (NTAs). However, an NTA for a pr...

Output containment control problems for high-order linear time-invariant swarm systems under directed interaction topologies are investigated using a dynamic output feedback approach. Firstly, to propel the outputs of followers to converge to the convex hull formed by the outputs of leaders, a dynamic output containment protocol is presented. Thennecessary and sufficient conditions for swarm sy...

In the 2002 case Simat Corp v. Arizona Health Care Containment System, the Arizona Supreme Court ruled that the Arizona Health Care Containment System must pay for abortions when they are necessary to preserve the health of pregnant women in the system. In the case, the Court ruled that the Arizona Revised Statutes 35-196.02 and the Arizona Health Care Containment System (AHCCCS) policies, whic...

Higher-order transformations are ubiquitous within data management. In relational databases, higher-order queries appear in numerous aspects including query rewriting and query specification. This work investigates languages that combine higher-order transformations with ordinary relational database query languages. We study the two most basic computational problems associated with these query ...

Computer worms — malicious, self-propagating programs — represent a significant threat to large networks. One possible defense, containment, seeks to limit a worm’s spread by isolating it in a small subsection of the network. In this work we develop containment algorithms suitable for deployment in high-speed, low-cost network hardware. We show that these techniques can stop a scanning host aft...