203 search results - page 11 / 41 » Datatype-Generic Termination Proofs |
160
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
156
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
143
click to vote
VSTTE
2010
Springer
15 years 3 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
168
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
141
click to vote
RTA
1997
Springer
15 years 10 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...