1024 search results - page 30 / 205 » Value complete, column complete, predicate complete |
JSYML
2008
14 years 9 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
AAAI
2010
14 years 11 months ago
2010
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...
SAT
2007
Springer
15 years 4 months ago
2007
Springer
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...
ICNC
2005
Springer
15 years 3 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
SDM
2003
SIAM
14 years 11 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...