On the transformation of logic programs with instantiation based computation rules

DOI10.1016/S0747-7171(89)80046-XzbMath0669.68058OpenAlexW2092096356MaRDI QIDQ1119029

Maurice Bruynooghe, Danny De Schreye

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80046-x

zbMATH Keywords

logic programmingprogram synthesisautomated programmingcomutation ruleHorn clause programinstantiation-based computation rulesubgoal shuffling

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Related Items (2)

A general criterion for avoiding infinite unfolding during partial deduction ⋮ Compiling bottom-up and mixed derivations into top-down executable logic programs

Uses Software

• Refal

Cites Work

• Unnamed Item
• On the inference of Turing machines from sample computations
• Automating control for logic programs
• Making prolog more expressive
• The concept of a supercompiler
• Compiling control
• Derivation of Logic Programs
• A Transformation System for Developing Recursive Programs
• Algorithm = logic + control

This page was built for publication: On the transformation of logic programs with instantiation based computation rules