42 search results - page 5 / 9 » Modular Equivalence for Normal Logic Programs |
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
96
Voted
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
182
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
113
click to vote
CONCUR
2011
Springer
13 years 9 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...