3513 search results - page 225 / 703 » Super Logic Programs |
138
click to vote
KSEM
2010
Springer
15 years 2 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
237
click to vote
ECOOP
2009
Springer
16 years 5 months ago
2009
Springer
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
112
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. We present KeY-C, a tool for deductive verification of C programs. KeY-C allows to prove partial correctness of C programs relative to pre- and postconditions. It is base...
117
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
139
click to vote
FLOPS
2004
Springer
15 years 9 months ago
2004
Springer
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...