Sciweavers

1000 search results - page 38 / 200
» Nominal rewriting systems
Sort
View
RTA
2005
Springer
14 years 1 months ago
Natural Narrowing for General Term Rewriting Systems
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...
Santiago Escobar, José Meseguer, Prasanna T...
FMOODS
2003
13 years 9 months ago
A Rewriting Based Model for Probabilistic Distributed Object Systems
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...
Nirman Kumar, Koushik Sen, José Meseguer, G...
IJCAI
2003
13 years 9 months ago
Recycling Computed Answers in Rewrite Systems for Abduction
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
Fangzhen Lin, Jia-Huai You
ENTCS
2008
131views more  ENTCS 2008»
13 years 7 months ago
Connector Rewriting with High-Level Replacement Systems
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primi...
Christian Koehler, Alexander Lazovik, Farhad Arbab
CADE
2001
Springer
14 years 8 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain