Sciweavers

2501 search results - page 122 / 501
» Logics with Rank Operators
Sort
View
107
Voted
JAPLL
2010
111views more  JAPLL 2010»
14 years 8 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
125
Voted
AAAI
2011
14 years 1 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
102
Voted
TARK
2007
Springer
15 years 7 months ago
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of age...
Philippe Balbiani, Alexandru Baltag, Hans P. van D...
87
Voted
DEON
2004
Springer
15 years 6 months ago
On Obligations and Abilities
Abstract. In this paper, we combine deontic logic with Alternatingtime Temporal Logic (ATL) into a framework that makes it possible to model and reason about obligations and abilit...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...
97
Voted
AAAI
1997
15 years 2 months ago
Representing Sequences in Description Logics
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
Haym Hirsh, Daniel Kudenko