2035 search results - page 54 / 407 » On the complexity of stratified logics |
140
click to vote
CADE
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
154
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper presents a new scheduling technique to improve the speed, power, and scalability of a dynamic scheduler. In a high-performance superscalar processor, the instruction sc...
141
click to vote
FOSSACS
2007
Springer
16 years 9 days ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
149
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
158
click to vote
DLOG
2003
15 years 7 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...