500 search results - page 66 / 100 » ACD Term Rewriting |
119
Voted
ERSHOV
1999
Springer
15 years 6 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...
78
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
118
click to vote
ACL
1996
15 years 3 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
128
click to vote
JACM
2007
15 years 1 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
127
click to vote
LOPSTR
2009
Springer
15 years 8 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...