4513 search results - page 386 / 903 » Logic programming with satisfiability |
169
click to vote
RTA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
130
click to vote
KI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
133
click to vote
LOPSTR
2004
Springer
15 years 10 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...
159
click to vote
ASP
2003
Springer
15 years 10 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...
134
click to vote
GECCO
1999
Springer
15 years 9 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...