50 search results - page 4 / 10 » On Bounded Rational Trace Languages |
GG
2004
Springer
14 years 3 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
DALT
2005
Springer
14 years 3 months ago
2005
Springer
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
CP
2007
Springer
14 years 4 months ago
2007
Springer
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
ERSHOV
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...