275 search results - page 13 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
We study logical properties that concern the preservation of futuredirected obligations that have not been fulfilled yet. Our starting point is a product of temporal and deontic ...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
DATE
1999
IEEE
14 years 1 days ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
BIS
2010
13 years 2 months ago
2010
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
JCSS
2000
13 years 7 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...