4513 search results - page 10 / 903 » Logic programming with satisfiability |
196
click to vote
POPL
2002
ACM
16 years 2 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
134
click to vote
LOGCOM
2010
14 years 9 months ago
2010
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
228
click to vote
POPL
2008
ACM
16 years 2 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...
126
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
148
click to vote
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...