Sciweavers

5243 search results - page 269 / 1049
» Reasoning About Strategies
Sort
View
ICLP
1998
Springer
15 years 11 months ago
A Choice-Point Library for Backtrack Programming
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...
Pierre-Etienne Moreau
ALP
1997
Springer
15 years 11 months ago
Perpetuality and Uniform Normalization
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 ...
Zurab Khasidashvili, Mizuhito Ogawa
FLOPS
2004
Springer
15 years 10 months ago
Implementing Natural Rewriting and Narrowing Efficiently
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...
Santiago Escobar
CSL
2008
Springer
15 years 6 months ago
User simulation in a stochastic dialog system
We present a new methodology of user simulation applied to the evaluation and refinement of stochastic dialog systems. Common weaknesses of these systems are the scarceness of the...
Francisco Torres, Emilio Sanchis, Encarna Segarra
184
Voted
ECSQARU
2009
Springer
15 years 4 months ago
Can the Minimum Rule of Possibility Theory Be Extended to Belief Functions?
Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
Sébastien Destercke, Didier Dubois