Search:
Computing and Library Services - delivering an inspiring information environment

Effectively Solving NP-SPEC Encodings by Translation to ASP

Alviano, Mario and Faber, Wolfgang (2015) Effectively Solving NP-SPEC Encodings by Translation to ASP. Journal of Experimental and Theoretical Artificial Intelligence, 27 (5). pp. 577-601. ISSN 0952-813X

[img]
Preview
PDF - Accepted Version
Download (264kB) | Preview

Abstract

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 ASP, and provide an experimental evaluation of existing implementations and the proposed translations to ASP using various ASP solvers. The results show that translating to ASP clearly has an edge over the existing translation into SAT, which involves an intrinsic grounding process. We also argue that it might be useful to incorporate certain language constructs of NPSPEC into mainstream ASP.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Schools: School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
School of Computing and Engineering > High-Performance Intelligent Computing > Planning, Autonomy and Representation of Knowledge
Related URLs:
Depositing User: Wolfgang Faber
Date Deposited: 04 Dec 2014 15:12
Last Modified: 05 Jan 2016 06:41
URI: http://eprints.hud.ac.uk/id/eprint/22773

Downloads

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 ©