23201 search results - page 49 / 4641 » Rewriting Systems with Data |
119
Voted
CADE
2006
Springer
16 years 3 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
111
Voted
RP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
134
click to vote
FM
1997
Springer
15 years 7 months ago
1997
Springer
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
157
Voted
ESSLLI
2009
Springer
15 years 1 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
115
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...