10997 search results - page 2 / 2200 » On the Structure of Complete Sets |
AAAI
2010
13 years 7 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
ACS
2010
13 years 6 months ago
2010
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
EMNLP
2009
13 years 3 months ago
2009
Set expansion refers to expanding a partial set of "seed" objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), w...
COCO
1989
Springer
13 years 10 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...