Sciweavers

3470 search results - page 238 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
POPL
1995
ACM
15 years 10 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip
ENTCS
2008
170views more  ENTCS 2008»
15 years 6 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
ALT
1994
Springer
15 years 10 months ago
Explanation-Based Reuse of Prolog Programs
This paper presents a method of extracting subprograms from background knowledge. Most studies on learning logic programs so far developed are mainly concerned with pure Prolog, so...
Yasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
15 years 7 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 6 months ago
Model-Driven Constraint Programming
Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calcula...
Raphaël Chenouard, Laurent Granvilliers, Rica...