291 search results - page 17 / 59 » On the Complexity of Fragments of Modal Logics |
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
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 propert...
WOLLIC
2007
Springer
15 years 6 months ago
2007
Springer
We survey several computational interpretations of classical linear logic based on two-player one-move games. The moves of the games are higherorder functionals in the language of ...
123
click to vote
CONCUR
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...