110 search results - page 7 / 22 » A Finite Model Construction for Coalgebraic Modal Logic |
APAL
2007
13 years 6 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
CSL
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
IGPL
2008
2008
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
13 years 6 months ago
APAL
2006
13 years 6 months ago
2006
We show that--unlike products of `transitive' modal logics which are usually undecidable-their `expanding domain' relativisations can be decidable, though not in primiti...
KI
2008
Springer
13 years 6 months ago
2008
Springer
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 ...