Osorio, M; Pérez, JAN; Arrazola, J; (2002) Equivalence in Answer Set Programming. In: Pettorossi, A, (ed.) Logic Based Program Synthesis and Transformation. 11th International Workshop, LOPSTR 2001 Paphos, Cyprus, November 28–30, 2001 Selected Papers. (pp. 57 - 75). Springer Berlin Heidelberg

Preview

PDF Navarro_lopstr01.pdf Download (212kB)

Abstract

We study the notion of strong equivalence between two Answer Set programs and we show how some particular cases of testing strong equivalence between programs can be reduced to verify if a formula is a theorem in intuitionistic or classical logic. We present some program transformations for disjunctive programs, which can be used to simplify the structure of programs and reduce their size. These transformations are shown to be of interest for both computational and theoretical reasons. Then we propose how to generalize such transformations to deal with free programs (which allow the use of default negation in the head of clauses). We also present a linear time transformation that can reduce an augmented logic program (which allows nested expressions in both the head and body of clauses) to a program consisting only of standard disjunctive clauses and constraints.

Download activity - last month

Export as XMLJSONCSV

Download activity - last 12 months

Export as CSVXMLJSON

Downloads by country - last 12 months

Export as CSVXMLJSON

Archive Staff Only

View Item