Guarded resolution for answer set programming
Marek, V. W. · Remmel, J. B.
Original · EN
We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.