279 search results - page 7 / 56 » Typability in Partial Applicative Structures |
131
click to vote
JAIR
2008
14 years 11 months ago
2008
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
UAI
2001
15 years 1 months ago
2001
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
107
click to vote
DAGSTUHL
1996
15 years 1 months ago
1996
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
FLOPS
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
CP
2007
Springer
15 years 5 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...