134 search results - page 14 / 27 » Natural Deduction Calculus for Computation Tree Logic |
ESOP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
BIRTHDAY
2003
Springer
14 years 26 days ago
2003
Springer
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
CONTEXT
1999
Springer
13 years 12 months ago
1999
Springer
Appeared in: P. Bouquet, P. Br´ezillon, L. Serafini, M. Benerecetti, F. Castellani (Eds.), 2nd International and Interdisciplinary Conference on Modeling and Using Context (CONT...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...