An Application of Proof-Theory in Answer Set Programming

Details An Application of Proof-Theory in Answer Set Programming An Application of Proof-Theory in Answer Set Programming

2009-05-02

arxiv.org/abs/0905.0197v2

Computer Science

Artificial Intelligence

22 pages. Short version was published in ICLP08. New version slightly shorter than the previous version

Scientific paper

We apply proof-theoretic techniques in answer Set Programming. The main
results include: 1. A characterization of continuity properties of
Gelfond-Lifschitz operator for logic program. 2. A propositional
characterization of stable models of logic programs (without referring to loop
formulas.

Affiliated with

Also associated with

No associations

Rating

An Application of Proof-Theory in Answer Set Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Application of Proof-Theory in Answer Set Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Application of Proof-Theory in Answer Set Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100983