Sciweavers

1587 search results - page 169 / 318
» The Semantics of Extended SOFL
Sort
View
WOLLIC
2009
Springer
14 years 3 months ago
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Hugo Herbelin, Gyesik Lee
LPNMR
2009
Springer
14 years 3 months ago
On the Input Language of ASP Grounder Gringo
We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime...
Martin Gebser, Roland Kaminski, Max Ostrowski, Tor...
ASIAN
2007
Springer
128views Algorithms» more  ASIAN 2007»
14 years 3 months ago
A Formal Analysis for Capturing Replay Attacks in Cryptographic Protocols
Abstract. We present a reduction semantics for the LYSA calculus extended with session information, for modelling cryptographic protocols, and a static analysis for it. If a protoc...
Han Gao, Chiara Bodei, Pierpaolo Degano, Hanne Rii...
FSTTCS
2007
Springer
14 years 3 months ago
Propositional Dynamic Logic for Message-Passing Systems
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
ICCS
2007
Springer
14 years 3 months ago
Constants and Functions in Peirce's Existential Graphs
The system of Peirce’s existential graphs is a diagrammatic version of first order logic. To be more precisely: As Peirce wanted to develop a logic of relatives (i.e., relations...
Frithjof Dau