Sciweavers

1144 search results - page 104 / 229
» Logic programming for combinatorial problems
Sort
View
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
15 years 4 months ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina
CSCLP
2008
Springer
15 years 4 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
131
Voted
IOR
2007
106views more  IOR 2007»
15 years 2 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
IDT
2010
124views more  IDT 2010»
15 years 1 months ago
Modelling decision making with probabilistic causation
Humans know how to reason based on cause and effect, but cause and effect is not enough to draw conclusions due to the problem of imperfect information and uncertainty. To resol...
Luís Moniz Pereira, Carroline Kencana Ramli
139
Voted
TPHOL
2009
IEEE
15 years 9 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk