705 search results - page 10 / 141 » Approximating Extended Answer Sets |
LPNMR
2007
Springer
2007
Springer
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
15 years 3 months ago
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
103
click to vote
JDCTA
2010
14 years 4 months ago
2010
In this paper we introduce the semantic approach of the answer extraction component of a question answering system called SBUQA. The answer extraction component gets the retrieved...
IPL
2008
14 years 9 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...