3470 search results - page 335 / 694 » Head-Elementary-Set-Free Logic Programs |
271
click to vote
ECOOP
2009
Springer
16 years 7 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...
140
click to vote
CADE
2007
Springer
16 years 7 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...
152
click to vote
ICFP
2004
ACM
16 years 6 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...
175
click to vote
FLOPS
2004
Springer
16 years 1 days 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...
205
click to vote
AUSAI
2005
Springer
16 years 6 days ago
2005
Springer
In this paper, I will show how a controlled natural language can be used to describe knowledge for the Semantic Web and discuss the formal properties of this language. At the firs...