3513 search results - page 299 / 703 » Super Logic Programs |
127
Voted
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
150
click to vote
ASP
2003
Springer
15 years 9 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
127
click to vote
GECCO
1999
Springer
15 years 8 months ago
1999
Springer
This paper demonstrates the ability of genetic programming to evolve analog circuits that perform digital functions and mixed analog-digital circuits. The evolved circuits include...
247
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
139
Voted
ICLP
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...