212 search results - page 28 / 43 » Completeness and Complexity of Bounded Model Checking |
COMPGEOM
2010
ACM
14 years 15 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
AAAI
2006
13 years 8 months ago
2006
We present a new propagator achieving bound consistency for the INTER-DISTANCE constraint. This constraint ensures that, among a set of variables X1, . . . , Xn, the difference be...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...