Alviano, Mario and Faber, Wolfgang (2013) Solving NP-SPEC Domains Using ASP. In: 20th RCRA International Workshop on "Experimental Evaluation of Algorithms for solving problems with combinatorial explosion", 14-15 June 2013, Rome, Italy.

NP-SPEC is a language for specifying problems in NP in a declarative way. Despite the fact that the semantics of the language was given by referring to Datalog with circumscription, which is very close to ASP, so far the only existing implementations are by means of ECLiPSe Prolog and via Boolean satisfiability solvers. In this paper, we present translations from NP-SPEC into various forms of ASP, and provide an experimental evaluation of existing implementations and the proposed translations to ASP using various ASP solvers. We also argue that it might be useful to incorporate certain language constructs of NP-SPEC into mainstream ASP.

rcra2013.pdf - Accepted Version

Download (140kB) | Preview


Downloads per month over past year

Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email