LPNMR 2004 Logic Programming and Nonmonotonic Reasoning
 |  |
Wall of Fame | Most Viewed LPNMR-2004 Paper
LPNMR
2004
Springer
14 years 5 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 170 | ||
| 2 | | 163 | ||
| 3 | | 156 | ||
| 4 | | 144 | ||
| 5 | | 136 | ||
| 6 | | 131 | ||
| 7 | | 123 | ||
| 8 | | 120 | ||
| 9 | | 118 | ||
| 10 | | 109 | ||
| 11 | | 108 | ||
| 12 | | 106 | ||
| 13 | | 105 | ||
| 14 | | 93 | ||
| 15 | | 88 | ||
| 16 | | 84 | ||
| 17 | | 83 | ||
| 18 | | 69 |