181 search results - page 5 / 37 » On the Completeness of Propositional Hoare Logic |
APAL
1999
13 years 9 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
SEFM
2009
IEEE
14 years 4 months ago
2009
IEEE
—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...
TARK
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a logic designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent prefere...
SAS
2009
Springer
14 years 10 months ago
2009
Springer
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
LFCS
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...