181 search results - page 30 / 37 » On the Completeness of Propositional Hoare Logic |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
83
Voted
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
101
click to vote
JELIA
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...