Deep generative models make visual content creation more accessible to novice users by automating the synthesis of diverse, realistic based on a collected dataset. However, current machine learning approaches miss key element creative process - ability synthesize things that go far beyond data distribution and everyday experience. To begin address this issue, we enable user "warp" given model e...

This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewritingbased formalism for defining programming languages and calculi. Akin to graph rewriting rules, the K (rewrite) rules explicitly state what can be concurrently shared with other rules. The desired true concurrency is obtained by translating the K rules into a novel ...

Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite given query to an equivalent SQL or Datalog associated with the ontology. This approach been intensively studied for conjunctive in DL-Lite EL families, but is much less explored more expressive DLs queries. We present rewriting-base...

We have proposed a novel computation framework called Equivalent Transformation (ET). The ET framework is a rewriting system in which computation is executed by rewriting rules. Rewriting rules of the ET framework are called Equivalent Transformation Rules (ETRs). The theory of ET guarantees the correctness of the computation by ETRs. Multi-head ETRs which have multiple atoms in their head part...

In this paper we present a rewriting semantics of membrane systems based on strategies. We use strategies to describe the control mechanisms in membranes. We provide strategies for maximally parallel rewriting, and for maximally parallel rewriting with priorities between rules. Maximally parallel rewriting with promoters or inhibitors requires an additional encoding of the rules.

Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle evaluation rules which implement parallel term rewriting steps. By using additional hypergraph rules which “fold” equal subterms, even non-left-linear term rewriting systems can be implemented. As a side effect, these folding rules can speed up the...

Planning by Rewriting (PbR) is a new paradigm for efcient high-quality planning that exploits plan rewriting rules and e cient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a high-quality plan. Despite the advantages of PbR in terms of scalability, plan quality, and anytime behavior, PbR requires the user to de ne a set of domain-speci c pl...