We address the issue of Ontology-Based Data Access which consists of exploiting the semantics expressed in ontologies while querying data. Ontologies are represented in the framework of existential rules, also known as Datalog+/-. We focus on the backward chaining paradigm, which involves rewriting the query (assumed to be a conjunctive query, CQ) into a set of CQs (seen as a union of CQs). The...

In the area of membrane computing, a new computability model, now called P system was introduced by PAUN (2002) inspired from the cell structure and its functioning. One area of P systems deals with string objects and rewriting rules. Recently, array P systems with array objects and array rewriting rules were introduced. Here we introduce a new class of array P systems called sequential/paralle...

Previously, Soeken and Thomsen presented six basic semantics-preserving rules for rewriting reversible logic circuits, defined using the well-known diagrammatic notation of Feynman. While this notation is both useful and intuitive for describing reversible circuits, its shortcomings in generality complicates the specification of more sophisticated and abstract rewriting rules. In this paper, we...

In this paper we show it is possible to embed graph transformation systems (GTS) soundly and completely in constraint handling rules (CHR). We suggest an encoding for the graph production rules and we investigate its soundness and completeness by ensuring equivalence of rule applicability and results. We furthermore compare the notion of confluence in both systems and show how to adjust a stand...

The classical DPO graph rewriting construction is re-expressed using the oppbration approach introduced originally for term graph rewriting. Using a skeleton category of graphs, a base of canonical graphs-in-context, with DPO rules as arrows, and with categories of redexes over each object in the base, yields a category of rewrites via the discrete Grothendieck construction. The various possibl...

We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dependency structures. This general framework allows us to accurately recover both grammatical and semantic information as well as non-local dependencies. It also facilitates dependency-based evaluation of phrase structur...

We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewriting the query using ontological knowledge. We focus here on the basic rewriting technique which consists of rewriting a conjunctive query (CQ) into a union of CQs. We assume that the set of rules is a finite unifica...

Deduction modulo is a framework in which theories are integrated into proof systems such as natural deduction or sequent calculus by presenting them using rewriting rules. When only terms are rewritten, cut admissibility in those systems is equivalent to the confluence of the rewriting system, as shown by Dowek, RTA 2003, LNCS 2706. This is no longer true when considering rewriting rules involv...

We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...

We define a type inference system for Nominal Rewriting where the types associated to terms are polymorphic (built from a set of base data sorts, type variables, and user-defined type constructors). In contrast with standard term rewriting systems or the λ-calculus, a typing environment for nominal rewriting includes type information for atoms, variables and function symbols. We give a syntax-d...