2573 search results - page 98 / 515 » Combinations of Modal Logics |
128
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
146
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
151
click to vote
LFCS
2007
Springer
15 years 10 months 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...
145
click to vote
CSL
2001
Springer
15 years 8 months ago
2001
Springer
In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the model...
150
Voted
DLOG
2001
15 years 5 months ago
2001
This paper investigates an optimization technique for reasoning with qualified number restrictions in the description logic ALCQHR+ . We present a hybrid architecture where a stan...