1702 search results - page 42 / 341 » Doomed program points |
123
click to vote
LPNMR
2005
Springer
15 years 10 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
187
Voted
AMAI
1999
Springer
15 years 4 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
140
Voted
SAS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
165
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
128
click to vote
MFPS
1993
15 years 8 months ago
1993
All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...