622 search results - page 75 / 125 » Answer Set Programming and Bounded Model Checking |
ICALP
1995
Springer
13 years 11 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
MP
2006
13 years 8 months ago
2006
We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
DAC
2004
ACM
14 years 9 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...