711 search results - page 141 / 143 » Modal Logics are Coalgebraic |
AIML
2004
14 years 11 months ago
2004
We are going to show that the standard notion of Kripke completeness is the strongest one among many provably distinct algebraically motivated completeness properties, some of whic...
IJCAI
2003
14 years 11 months ago
2003
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
119
click to vote
CI
2000
14 years 9 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
SYNTHESE
2010
14 years 8 months ago
2010
The focus of the paper is on the logic of clarity and the problem of higherorder vagueness. We first examine the consequences of the notion of intransitivity of indiscriminabilit...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...