Translating NP-SPEC into ASP

01/08/2013
by   Mario Alviano, et al.
0

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 analyze them. We also argue that it might be useful to incorporate certain language constructs of NP-SPEC into mainstream ASP.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2019

Beyond NP: Quantifying over Answer Sets

Answer Set Programming (ASP) is a logic programming paradigm featuring a...
research
09/22/2020

LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories

Answer set programming (ASP) is a well-established knowledge representat...
research
08/09/2021

FOLASP: FO(.) as Input Language for Answer Ser Solvers

Over the past decades, Answer Set Programming (ASP) has emerged as an im...
research
02/17/2018

Almost Sure Productivity

We define Almost Sure Productivity (ASP), a probabilistic generalization...
research
08/05/2016

Stable-Unstable Semantics: Beyond NP with Normal Logic Programs

Standard answer set programming (ASP) targets at solving search problems...
research
10/11/2022

Planning Assembly Sequence with Graph Transformer

Assembly sequence planning (ASP) is the essential process for modern man...
research
03/09/2020

A Uniform Treatment of Aggregates and Constraints in Hybrid ASP

Characterizing hybrid ASP solving in a generic way is difficult since on...

Please sign up or login with your details

Forgot password? Click here to reset