9719 search results - page 133 / 1944 » Answer Set Optimization |
STACS
2007
Springer
15 years 6 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
126
Voted
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
90
Voted
PODS
2003
ACM
16 years 27 days ago
2003
ACM
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
85
Voted
CIE
2005
Springer
15 years 6 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
100
click to vote
ECSQARU
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...