DSpace - Tor Vergata >
Facoltà di Ingegneria >
Dipartimento di informatica, sistemi e produzione >
Research reports >
Please use this identifier to cite or link to this item:
|Title: ||Proving properties of constraint logic programs by eliminating existential variables|
|Authors: ||Pettorossi, Alberto|
|Issue Date: ||Feb-2007 |
|Publisher: ||Dipartimento di informatica, sistemi e produzione|
|Series/Report no.: ||Research report|
|Abstract: ||We propose a method for proving first order properties of constraint logic programs which manipulate finite lists of real numbers.
Constraints are linear equations and inequations over reals. Our method consists in converting any given first order formula into a stratified constraint logic program and then applying a suitable unfold/fold transformation strategy that preserves the perfect model. Our strategy is based on the elimination of existential variables, that is, variables which occur in the body of a clause and not in its head. Since, in general, the first order properties of the class of programs we consider are undecidable, our strategy is necessarily incomplete. However, experiments show that it is powerful enough to prove several non-trivial program properties.|
|Appears in Collections:||Research reports|
Files in This Item:
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.