4513 search results - page 66 / 903 » Logic programming with satisfiability |
ESOP
2010
Springer
15 years 11 months ago
2010
Springer
106
click to vote
FORMATS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction...
107
click to vote
DLT
2004
15 years 2 months ago
2004
A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NPcomplete. The fragment is larger than previously kn...