Algorithm Selection for Paracoherent Answer Set Computation

Abstract Answer Set Programming (ASP) is a well-established AI formalism rooted in nonmonotonic reasoning. Paracoherent semantics for ASP have been proposed to derive useful conclusions also in the absence of answer sets caused by cyclic default negation. Recently, several different algorithms have been proposed to implement them, but no algorithm is always preferable to the others in all instances. In this paper, we apply algorithm selection techniques to devise a more efficient paracoherent answer set solver combining existing algorithms. The effectiveness of the approach is demonstrated empirically running our system on existing benchmarks.

Authors

• Giovanni Amendola
• Carmine Dodaro
• Wolfgang Faber 0001
• Luca Pulina
• Francesco Ricca

Keywords

No keywords are indexed for this paper.