Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
A transformation system for deductive database modules with perfect model semantics
Theoretical Computer Science
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
PLILP '91 Selected papers of the symposium on Programming language implementation and logic programming
Transformations of CLP modules
Theoretical Computer Science
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Verification of Parameterized Systems Using Logic Program Transformations
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Perfect Model Checking via Unfold/Fold Transformations
CL '00 Proceedings of the First International Conference on Computational Logic
Principles of Constraint Programming
Principles of Constraint Programming
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
The transformational approach to program development
A 25-year perspective on logic programming
A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Proving Theorems by Program Transformation
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
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.