34 search results - page 1 / 7 » An NP-Complete Fragment of LTL |
SOFSEM
2005
Springer
13 years 10 months ago
2005
Springer
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Recently, Linear Temporal Logic (LTL) has been successfully applied to high-level task and motion planning problems for mobile robots. One of the main attributes of LTL is its ...
DLT
2004
13 years 6 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...
AR
2008
13 years 5 months ago
2008
Recently, Linear Temporal Logic (LTL) has been successfully applied to high-level task and motion planning problems for mobile robots. One of the main attributes of LTL is its clo...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...