Transformations of logic programs on infinite lists

Pettorossi, Alberto; Senni, Valerio; Proietti, Maurizio

doi:10.1017/s1471068410000177

Cited by 5 publications

(1 citation statement)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this area we mention two papers: (i) the [PPS10] paper, which presents correctness results of some transformation rules for locally stratified general programs whose semantics is an extension of the perfect model, and (ii) the [Sek11] paper, which shows the correctness of a set of transformation rules for coinductive logic programs, that is, logic programs whose semantics is defined by means of greatest fixpoints, besides the usual least fixpoints [SMB06]. We leave it to future studies the extension of our constraint-based approach to logic programs on infinite structures.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Constraint-based correctness proofs for logic program transformations

2012

Self Cite

View full text Add to dashboard Cite

Many approaches proposed in the literature for proving the correctness of unfold/fold transformations of logic programs make use of measures associated with program clauses. When from a program P 1 we derive a program P 2 by applying a sequence of transformations, suitable conditions on the measures of the clauses in P 2 guarantee that the transformation of P 1 into P 2 is correct, that is, P 1 and P 2 have the same least Herbrand model. In the approaches proposed so far, clause measures are fixed in advance, independently of the transformations to be proved correct. In this paper we propose a method for the automatic generation of clause measures which, instead, takes into account the particular program transformation at hand. During the application of a sequence of transformations we construct a system of linear equalities and inequalities over nonnegative integers whose unknowns are the clause measures to be found, and the correctness of the transformation is guaranteed by the satisfiability of that system. Through some examples we show that our method is more powerful and practical than other methods proposed in the literature. In particular, we are able to establish in a fully automatic way the correctness of program transformations which, by using other methods, are proved correct at the expense of fixing in advance sophisticated clause measures.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%