Sciweavers

8437 search results - page 37 / 1688
» Preferences over Sets
Sort
View
LPNMR
2007
Springer
15 years 6 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
PODS
2006
ACM
134views Database» more  PODS 2006»
16 years 25 days ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
100
Voted
CC
2007
Springer
158views System Software» more  CC 2007»
15 years 21 days ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
STACS
2010
Springer
15 years 7 months ago
On Equations over Sets of Integers
Artur Jez, Alexander Okhotin
77
Voted
STACS
2009
Springer
15 years 7 months ago
Equations over Sets of Natural Numbers with Addition Only
Artur Jez, Alexander Okhotin