7167 search results - page 136 / 1434 » Answer Set Programming |
105
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
STACS
2007
Springer
15 years 7 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 7 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...
110
Voted
ISMIS
1994
Springer
15 years 4 months ago
1994
Springer
We assume that safety of information stored in a database depends on the reliability of the agents who have performed the insertions in the database. We present a logic S to repres...
90
Voted
PODS
2003
ACM
16 years 28 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...