181 search results - page 34 / 37 » On the Completeness of Propositional Hoare Logic |
102
click to vote
RTA
2004
Springer
15 years 2 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
104
click to vote
LOGCOM
2007
14 years 9 months ago
2007
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
112
click to vote
NMR
2004
Springer
15 years 3 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
This paper proposes a Compiled Labelled Deductive System, called ACCLDS, for reasoning about role-based access control in distributed systems, which builds upon Massacci’s tablea...
109
click to vote
NMR
2004
Springer
15 years 3 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...