Sciweavers

4370 search results - page 419 / 874
» Algebra of Logic Programming
Sort
View
GECCO
1999
Springer
15 years 7 months ago
Large Populations Are Not Always The Best Choice In Genetic Programming
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
Matthias Fuchs
125
Voted
AAAI
2008
15 years 5 months ago
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
Vladimir Lifschitz
105
Voted
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 7 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
15 years 5 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
ECEASST
2008
82views more  ECEASST 2008»
15 years 3 months ago
Interaction nets: programming language design and implementation
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
Abubakar Hassan, Ian Mackie, Shinya Sato