181 search results - page 11 / 37 » On the Completeness of Propositional Hoare Logic |
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
104
click to vote
ENTCS
2006
14 years 9 months ago
2006
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
ENTCS
2008
14 years 9 months ago
2008
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
FOSSACS
2001
Springer
15 years 2 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
KR
2004
Springer
15 years 3 months ago
2004
Springer
Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...