Publications of Maurizio Proietti

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Proietti M., in the category IASI Research Reports (or show them all):


IASI Research Report n. 513  (Previous    Next)  

Alberto Pettorossi, Maurizio Proietti

Perfect model checking via unfold/fold transformations

ABSTRACT
We show how program transformation rules and strategies may be used for proving the satisfiability of first order formulas in some classes of models. In particular, we propose a technique for showing that a closed first order formula φ holds in the perfect model M(P ) of a logic program P with locally stratified negation. This property is denoted by M(P)╞ φ. For this purpose we consider a new version of the unfold/fold transformation rules and we show that this version preserves the perfect model semantics. Our proof method, called unfold/fold proof method, shows M(P)╞ φ by: (i) introducing a new predicate symbol fand constructing a conjunction F (f,φ) of clauses such that M(P)╞ φ iff ................., and then (ii) transforming the program ..........into a new program of the form ........., for some conjunction Q of clauses. We also present a strategy for applying our unfold/fold rules in a semi-automatic way. Our strategy may or may not terminate, depending on the initial program P and formula φ. However, we identify some classes of programs and formulas for which our strategy always terminates and thus, our strategy is a decision procedure for checking whether or not M(P)╞ φ holds for any given program P and formula φ in those classes.
back
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -