846 search results - page 18 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
DALT
2009
Springer
15 years 26 days ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
AIML
2008
14 years 11 months ago
2008
Most temporal logics, particularly interval temporal logics, are not expressive enough to capture meanings of natural language constructions, and they are not convenient to represe...
78
Voted
VLSID
1999
IEEE
15 years 1 months ago
1999
IEEE
We describe an improved iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. The speed and accuracy of our approach mak...
113
Voted
SBCCI
2003
ACM
15 years 2 months ago
2003
ACM
The growing adoption of reconfigurable architectures opens new implementation alternatives and creates new design challenges. In the case of dynamically reconfigurable architectur...
FOSSACS
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...