Sciweavers

3228 search results - page 130 / 646
» Computationally Sound Proofs
Sort
View
127
Voted
CSL
2004
Springer
15 years 7 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
AIML
2008
15 years 4 months ago
Undecidability for arbitrary public announcement logic
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
Tim French, Hans P. van Ditmarsch
COMMA
2006
15 years 4 months ago
Combining sceptical epistemic reasoning with credulous practical reasoning
Abstract. This paper proposes an argument-based semantics for combined epistemic and practical reasoning, taking seriously the idea that in certain contexts epistemic reasoning is ...
Henry Prakken
APAL
2010
129views more  APAL 2010»
15 years 3 months ago
Kripke models for classical logic
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
Danko Ilik, Gyesik Lee, Hugo Herbelin
124
Voted
APAL
2008
159views more  APAL 2008»
15 years 3 months ago
Approximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
Guilherme de Souza Rabello, Marcelo Finger