Sciweavers

118 search results - page 15 / 24
» Constraint Functional Logic Programming over Finite Domains
Sort
View
CSCLP
2006
Springer
15 years 1 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
ICML
2004
IEEE
15 years 10 months ago
Bellman goes relational
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
Kristian Kersting, Martijn Van Otterlo, Luc De Rae...
103
Voted
SAS
1995
Springer
127views Formal Methods» more  SAS 1995»
15 years 1 months ago
Complementation in Abstract Interpretation
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL“E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
Agostino Cortesi, Gilberto Filé, Roberto Gi...
72
Voted
PPDP
2009
Springer
15 years 4 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reļ...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
STACS
2000
Springer
15 years 1 months ago
Multi-linearity Self-Testing with Relative Error
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...
Frédéric Magniez