977 search results - page 7 / 196 » Logic programming with infinite sets |
234
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
145
click to vote
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
122
click to vote
NMR
2004
Springer
15 years 8 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
137
click to vote
CADE
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...