275 search results - page 15 / 55 » The Complexity of Generalized Satisfiability for Linear Temp... |
COMPGEOM
1996
ACM
13 years 12 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
JMM2
2008
13 years 7 months ago
2008
The preservation of temporal dependencies among different media data, such as text, still images, video and audio, and which have simultaneous distributed sources as origin, is an ...
ICDT
2007
ACM
14 years 1 months ago
2007
ACM
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
CONCUR
2001
Springer
14 years 6 days ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...