140 search results - page 18 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
118
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
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” nature ...
115
Voted
AAAI
2000
15 years 1 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
101
Voted
NMR
2004
Springer
15 years 5 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
HPCA
2005
IEEE
16 years 1 days ago
2005
IEEE
The use of large instruction windows coupled with aggressive out-oforder and prefetching capabilities has provided significant improvements in processor performance. In this paper...
SIGMOD
2010
ACM
14 years 12 months ago
2010
ACM
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...