534 search results - page 35 / 107 » Proving Termination of Rewrite Systems Using Bounds |
LOGCOM
2007
13 years 7 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...
APBC
2004
13 years 9 months ago
2004
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
ALP
1994
Springer
13 years 11 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...