3738 search results - page 483 / 748 » Parametrized Logic Programming |
117
click to vote
ICMLA
2010
14 years 10 months ago
2010
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
125
Voted
PADL
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
119
click to vote
CADE
2011
Springer
14 years 23 days ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
201
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
226
Voted
POPL
2003
ACM
16 years 1 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...