181 search results - page 13 / 37 » On the Completeness of Propositional Hoare Logic |
FSEN
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
AAAI
1998
14 years 11 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Completion is a general paradigm for applying inferences to generate a canonical presentation of a logical theory, or to semi-decide the validity of theorems, or to answer queries....