We show how unfold/fold program transformation techniques may be used for proving that a closed first order formula holds in the perfect model of a logic program with locally stratified negation. We present a program transformation strategy which is a decision procedure for some given classes of programs and formulas.
Pettorossi, A., Proietti, M. (2000). Perfect model checking via unfold/fold transformations. In COMPUTATIONAL LOGIC - CL 2000 (pp.613-628). BERLIN : SPRINGER-VERLAG BERLIN.
Perfect model checking via unfold/fold transformations
PETTOROSSI, ALBERTO;
2000-01-01
Abstract
We show how unfold/fold program transformation techniques may be used for proving that a closed first order formula holds in the perfect model of a logic program with locally stratified negation. We present a program transformation strategy which is a decision procedure for some given classes of programs and formulas.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
