787 search results - page 6 / 158 » Polynomial Constants are Decidable |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
DM
2010
13 years 8 months ago
2010
ECCC
2010
13 years 5 months ago
2010
KR
2010
Springer
14 years 22 days ago
2010
Springer
We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an ...
COCO
1995
Springer
13 years 11 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...