1144 search results - page 101 / 229 » Logic programming for combinatorial problems |
212
Voted
UPP
2004
Springer
15 years 7 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
118
click to vote
JAPLL
2010
14 years 9 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
152
click to vote
CONCUR
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
122
click to vote
SIGPLAN
2008
15 years 2 months ago
2008
It is argued that the teaching of programming is central to the education of skilled computer professionals, that the teaching of programming languages is central to the teaching ...
113
click to vote
ESOP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper concerns mechanisms for maintaining the value of an instrumentation predicate (a.k.a. derived predicate or view), defined via a logical formula over core pred...