Derivation of Logic Programs

DOI10.1145/322248.322258zbMATH Open0464.68021OpenAlexW2056168527MaRDI QIDQ3916005FDOQ3916005

Authors: Christopher J. Hogger 

Publication date: 1981

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322248.322258

zbMATH Keywords

computational logicprogram verificationprogram transformationprogram synthesis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited In (20)

• Equivalence-preserving first-order unfold/fold transformation systems
• Deductive and inductive synthesis of equational programs
• First order compiler: A deterministic logic program synthesis algorithm
• Title not available (Why is that?)
• LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY
• Synthesis of positive logic programs for checking a class of definitions with infinite quantification
• Truth versus information in logic programming
• Proof methods of declarative properties of definite programs
• Inductive assertion method for logic pograms
• Logic program synthesis from first-order logic specifications
• An equivalence preserving first order unfold/fold transformation system
• Logic program synthesis from incomplete specifications
• Unfold/fold transformations of logic programs
• Semantics of algorithmic languages
• Synthetic programming
• Logical debugging
• Transformations of CLP modules
• On the transformation of logic programs with instantiation based computation rules
• Program development schemata as derived rules
• Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs

This page was built for publication: Derivation of Logic Programs

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