934 search results - page 7 / 187 » Elementary Sets of Logic Programs |
LPNMR
2004
Springer
14 years 23 days 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...
ICALP
1991
Springer
13 years 11 months ago
1991
Springer
ESOP
1999
Springer
13 years 11 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
ASP
2003
Springer
14 years 19 days ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
AAAI
2007
13 years 9 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...