Volume : III, Issue : VIII, August - 2013

Stable Answer Set Programming

Mona Gharib, Amr I. Hassan

Abstract :

In answer set programming, the existence of an answer set for a logic program is not guaranteed. In order to remedy this problem, an incremental answer sets (ι–answer sets) have been introduced. The monotonicity of ι–answer sets is problematic, since it equates monotonic and nonmonotonic inferences. In this paper, we modify the definition of ι–answer sets in order to overcome these problems. Namely, we introduce the concept of stable answer sets which are characterized by their applied rules. Furthermore, we develop a sound and complete theorem proving method for our approach to answer set programming, which allows for query–oriented computations.

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

Mona Gharib, Amr I. Hassan Stable Answer Set Programming Indian Journal of Applied Research, Vol.III, Issue.VIII August 2013

Number of Downloads : 565

References :