825 search results - page 71 / 165 » Modal Logics with Counting |
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
TARK
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...
CSL
1999
Springer
14 years 4 days ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community: