Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio Proving Properties of Constraint Logic Programs by Eliminating Existential Variables. In: Logic Programming. Lecture Notes in Computer Science (4079). Springer, pp. 179-195. ISBN 978-3-540-36635-5 (2006)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||Proceedings of the 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006. An extended version of this paper appears as: Research Report 07.62, Dipartimento di Informatica, Sistemi e Produzione, University of Rome Tor Vergata, Rome, Italy, February 2007. Also presented at the 2006 Italian Conference on Computational Logic (CILC 2006), 26-27 June, 2006, Bari, Italy.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 40 not found.|
|Date Deposited:||26 Sep 2012 12:42|
|Last Modified:||07 Mar 2013 12:56|
Actions (login required)