1730 search results - page 207 / 346 » Algebra and Computation |
128
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
113
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
128
click to vote
KBSE
2000
IEEE
15 years 8 months ago
2000
IEEE
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
114
click to vote
COCO
1989
Springer
15 years 8 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract: Non-linear state estimation and some related topics, like parametric estimation, fault diagnosis, and perturbation attenuation, are tackled here via a new methodology in ...