534 search results - page 25 / 107 » Proving Termination of Rewrite Systems Using Bounds |
140
Voted
TISSEC
2002
15 years 5 months ago
2002
Language runtime systems are increasingly being embedded in systems to support runtime extensibility via mobile code. Such systems raise a number of concerns when the code running...
157
Voted
CADE
1994
Springer
15 years 9 months ago
1994
Springer
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
172
Voted
FROCOS
2009
Springer
16 years 5 days ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
145
Voted
AAAI
1994
15 years 7 months ago
1994
Bounded response time is an important requirement when rule-based expert systems are used in real-time applications. In the case the rule-based system cannot terminate in bounded ...