498 search results - page 77 / 100 » Term Rewriting |
181
click to vote
AGP
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
184
click to vote
RTA
2010
Springer
15 years 10 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...
198
click to vote
AISC
2010
Springer
15 years 9 months ago
2010
Springer
We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where pl...
230
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
166
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...