6829 search results - page 403 / 1366 » Quantitative Generalizations of Languages |
179
click to vote
COLT
1992
Springer
15 years 11 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
168
click to vote
MFPS
1993
15 years 11 months ago
1993
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
185
click to vote
UAI
1998
15 years 8 months ago
1998
Causal models defined in terms of a collection of equations, as defined by Pearl, are axiomatized here. Axiomatizations are provided for three successively more general classes of...
176
click to vote
ACTA
2005
15 years 6 months ago
2005
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
185
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...