444 search results - page 17 / 89 » Termination by Abstraction |
LATA
2009
Springer
15 years 6 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
WRLA
2010
14 years 10 months ago
2010
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. There have been several timed extensions of ACP-style process algebras with successful termination. None of them, to our knowledge, are equationally conservative (ground-...
102
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— An IP mobility support protocol that enables personal and terminal mobility for IP-based applications is put forward. This protocol does not require new network entitie...
LOGCOM
2007
14 years 11 months ago
2007
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...