181 search results - page 26 / 37 » On the Completeness of Propositional Hoare Logic |
TABLEAUX
2009
Springer
15 years 4 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
ENTCS
2008
14 years 9 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
JAIR
2008
14 years 9 months ago
2008
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
FM
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...