128 search results - page 10 / 26 » Ensuring Termination by Typability |
SAC
2006
ACM
13 years 7 months ago
2006
ACM
Wireless networks and mobile terminals are evolving towards being heterogeneous. In this environment, intelligent handover decision, beyond traditional ones that are based on only...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
ERSHOV
1999
Springer
13 years 11 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
JAPLL
2010
13 years 2 months ago
2010
We present a decision procedure for hybrid logic equipped with nominals, the satisfaction operator and existential, difference, converse, reflexive, symmetric and transitive modal...