20 search results - page 4 / 4 » lpnmr 2007 |
155
Voted
LPNMR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
133
click to vote
LPNMR
2007
Springer
15 years 11 months ago
2007
Springer
Answer-set programming (ASP) has become an important paradigm for declarative problem solving in recent years. However, to further improve the usability of answer-set programs, the...
141
click to vote
LPNMR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
144
Voted
LPNMR
2007
Springer
15 years 11 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
141
click to vote
LPNMR
2007
Springer
15 years 11 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...