173 search results - page 8 / 35 » Processes for Adhesive Rewriting Systems |
LICS
1990
IEEE
15 years 3 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
RTA
1995
Springer
15 years 3 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
92
Voted
ICTAI
1996
IEEE
15 years 3 months ago
1996
IEEE
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understan...
79
Voted
ENTCS
2002
14 years 11 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
114
Voted
TCS
2008
14 years 11 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...