Sciweavers

808 search results - page 119 / 162
» What Is Answer Set Programming
Sort
View
ICALP
1998
Springer
14 years 1 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
JWSR
2007
83views more  JWSR 2007»
13 years 8 months ago
Web Service Discovery and Composition for Virtual Enterprises
: One main characteristic of virtual enterprises are short-term collaborations between business partners to provide efficient and individualized services to customers. The MOVE pro...
Jürgen Dorn, Peter Hrastnik, Albert Rainer
KR
1998
Springer
14 years 1 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
14 years 14 days ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
NDJFL
2010
13 years 3 months ago
Polyadic Quantification via Denoting Concepts
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...
Ori Simchen