142 search results - page 4 / 29 » On the Existence of Answer Sets in Normal Extended Logic Pro... |
168
click to vote
IJCAI
1997
15 years 6 months ago
1997
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
160
Voted
LPNMR
2004
Springer
15 years 10 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â...
142
click to vote
NMR
2004
Springer
15 years 10 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
139
click to vote
IJCAI
2001
15 years 6 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
174
Voted
CORR
2004
Springer
15 years 4 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...