BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Service oriented architectures facilitate loosely coupled collaborations, which are established in a decentralized way. One challenge for such collaborations is to guaran...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
In the beginning, one of the main fields of application of graph transformation was biology, and more specifically morphology. Later, however, it was like if the biological appli...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract In this paper, we propose a new loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantic...