Sciweavers

Share
AAAI
2011
7 years 12 months ago
The Epistemic Logic Behind the Game Description Language
A general game player automatically learns to play arbitrary new games solely by being told their rules. For this purpose games are specified in the game description language GDL...
Ji Ruan, Michael Thielscher
ENTCS
2010
130views more  ENTCS 2010»
8 years 9 months ago
Structural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
Bartek Klin
JAPLL
2010
133views more  JAPLL 2010»
8 years 10 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
MLQ
2002
95views more  MLQ 2002»
8 years 11 months ago
Invariant Logics
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
Marcus Kracht
JSYML
2002
170views more  JSYML 2002»
8 years 11 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
ENTCS
2002
104views more  ENTCS 2002»
8 years 11 months ago
A Note on Coalgebras and Presheaves
We show that the category of coalgebras of a wide-pullback preserving endofunctor on a category of presheaves is itself a category of presheaves. This illustrates a connection bet...
James Worrell
JSYML
2007
85views more  JSYML 2007»
8 years 12 months ago
Lower bounds for modal logics
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
Pavel Hrubes
AAI
2004
114views more  AAI 2004»
8 years 12 months ago
Model Checking A Knowledge Exchange Scenario
We are interested in applying model checking techniques to the verification of communication protocols which require safe communication. Typically, in such scenarios, one desires ...
Sieuwert van Otterloo, Wiebe Der, Michael Wooldrid...
SYNTHESE
2008
99views more  SYNTHESE 2008»
8 years 12 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne
KI
2008
Springer
8 years 12 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
books