Unfold/fold program transformations
Algebraic methods in semantics
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
Handbook of theoretical computer science (vol. B)
Unfold/fold transformation of stratified programs
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
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs
Journal of the ACM (JACM)
Induction = I-axiomatization + first-order consistency
Information and Computation - Special issue on RTA-98
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
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Program Derivation = Rules + Strategies
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
On Negative Unfolding in the Answer Set Semantics
Logic-Based Program Synthesis and Transformation
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
The transformational approach to program development
A 25-year perspective on logic programming
On inductive proofs by extended unfold/fold transformation rules
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Transformational verification of parameterized protocols using array formulas
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Proving properties of constraint logic programs by eliminating existential variables
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
On inductive and coinductive proofs via unfold/fold transformations
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Proving properties of co-logic programs by unfold/fold transformations
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Proving Theorems by Program Transformation
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
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.