132 search results - page 11 / 27 » Lower bounds for modal logics |
87
Voted
FORMATS
2008
Springer
14 years 12 months ago
2008
Springer
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...
86
Voted
DLOG
2003
14 years 11 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
85
Voted
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
ICLP
2007
Springer
15 years 2 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
68
Voted
ICCAD
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper describes two techniques to quantify energy consumption of burst-modeasynchronous(clock-less)controlcircuits. The circuit specifications consideredare extended burst-m...