1743 search results - page 2 / 349 » Generalized Modal Satisfiability |
85
Voted
JANCL
2008
14 years 11 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...
110
Voted
FOSSACS
2010
Springer
15 years 6 months 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
14 years 11 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...
50
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
100
click to vote
LOGCOM
2007
14 years 11 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...