1743 search results - page 2 / 349 » Generalized Modal Satisfiability |
JANCL
2008
13 years 5 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
FOSSACS
2010
Springer
14 years 4 days ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
CORR
2006
Springer
13 years 5 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
LOGCOM
2007
13 years 5 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...