892 search results - page 53 / 179 » Strategies in sentential reasoning |
111
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
EWCBR
2004
Springer
2004
Springer
Facilitating CBR for Incompletely-Described Cases: Distance Metrics for Partial Problem Descriptions
15 years 6 months ago
A fundamental problem for case-based reasoning systems is how to select relevant prior cases. Numerous strategies have been developed for determining the similarity of prior cases,...
91
Voted
ICLP
1998
Springer
15 years 5 months ago
1998
Springer
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
121
Voted
ALP
1997
Springer
15 years 5 months ago
1997
Springer
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
102
Voted
FLOPS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Outermost-needed rewriting/narrowing is a sound and complete optimal demand-driven strategy for the class of inductively sequential constructor systems. Its parallel exte...