Synthesis of eureka predicates for developing logic programs

DOI10.1007/3-540-52592-0_71MaRDI QIDQ4038669zbMATH OpenFDO

Authors Maurizio Proietti, Alberto Pettorossi

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52592-0_71

zbMATH Keywords

developing logic programs by transformationeureka predicatesgeneralization strategyloop absorption strategy

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2077069
• scientific article; zbMATH DE number 2077065
• The transformational approach to program development
• scientific article; zbMATH DE number 440117
• Schema induction for logic program synthesis

Cited in

(8)

• Logic program synthesis from first-order logic specifications
• Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
• Linearisability on Datalog programs
• scientific article; zbMATH DE number 2077065 (Why is no real title available?)
• scientific article; zbMATH DE number 2077069 (Why is no real title available?)
• scientific article; zbMATH DE number 7453187 (Why is no real title available?)
• On transformations into linear database logic programs
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs

This page was built for publication: Synthesis of eureka predicates for developing logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038669)