534 search results - page 22 / 107 » Proving Termination of Rewrite Systems Using Bounds |
137
Voted
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
154
Voted
AISC
2008
Springer
15 years 6 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
127
Voted
PPDP
2007
Springer
15 years 10 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
136
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
127
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...