232 search results - page 26 / 47 » Termination of linear bounded term rewriting systems |
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
ASE
2005
13 years 7 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
AUTOMATICA
2004
13 years 7 months ago
2004
We study linear anti-windup augmentation for linear control systems with saturated linear plants in the special case when the anti-windup compensator can only modify the input and...