461 search results - page 7 / 93 » Splitting NP-Complete Sets |
ICLP
1994
Springer
14 years 3 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
LPNMR
2009
Springer
14 years 5 months ago
2009
Springer
CR-Prolog is an extension of A-Prolog, the knowledge representation language at the core of the Answer Set Programming paradigm. CR-Prolog is
APAL
1998
13 years 10 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
TASE
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
ESA
2001
Springer
14 years 3 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...