Computing and Library Services - delivering an inspiring information environment

Solving NP-SPEC Domains Using ASP

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.

PDF - Accepted Version
Download (140kB) | Preview


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.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering > High-Performance Intelligent Computing
School of Computing and Engineering
Related URLs:
Depositing User: Wolfgang Faber
Date Deposited: 08 Jul 2014 13:40
Last Modified: 28 Aug 2021 19:05


Downloads per month over past year

Repository Staff Only: item control page

View Item View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©