7167 search results - page 168 / 1434 » Answer Set Programming |
113
Voted
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
129
click to vote
MSS
2008
IEEE
15 years 2 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
100
click to vote
ICLP
1994
Springer
15 years 6 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
186
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
123
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...