Transformations of logic programs on infinite lists
From MaRDI portal
Publication:3585155
DOI10.1017/S1471068410000177zbMath1209.68096arXiv1007.4157OpenAlexW2157162154MaRDI QIDQ3585155
Valerio Senni, Alberto Pettorossi, Maurizio Proietti
Publication date: 19 August 2010
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4157
Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)
Related Items
Cites Work
- Unnamed Item
- Temporal logic programming
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
- Unfold/fold transformation of stratified programs
- A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters
- BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
- A Transformation System for Developing Recursive Programs
- Logic programming and negation: A survey