17 search results - page 3 / 4 » lfcs 2007 |
188
Voted
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
160
click to vote
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
187
Voted
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
149
Voted
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
182
click to vote
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...