3172 search results - page 49 / 635 » On the Random-Self-Reducibility of Complete Sets |
104
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
99
Voted
ECCC
2006
15 years 21 days ago
2006
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
88
Voted
JDA
2007
15 years 17 days ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
128
Voted
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
114
Voted
LMCS
2006
15 years 19 days ago
2006
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...