4126 search results - page 282 / 826 » Set based logic programming |
199
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
163
click to vote
ICMLA
2007
15 years 7 months ago
2007
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
142
click to vote
IFL
2001
Springer
15 years 10 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
217
click to vote
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
166
click to vote
ACG
2009
Springer
15 years 10 months ago
2009
Springer
Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy t...