228 search results - page 7 / 46 » Two Normal Forms for Rewriting P Systems |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
WADT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
VLDB
2011
ACM
13 years 2 months ago
2011
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas. They are an important tool in several areas of database research, notab...
AAAI
2006
13 years 8 months ago
2006
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...