825 search results - page 87 / 165 » Modal Logics with Counting |
MST
2011
13 years 2 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
JANCL
2008
13 years 8 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
CORR
2008
Springer
13 years 8 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...
LICS
2007
IEEE
14 years 2 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 ...