On Delphi lemmas and other memoing techniques for deterministic logic programs

DOI10.1016/S0743-1066(96)00105-7MaRDI QIDQ4365059zbMATH OpenWikidataFDO

Authors Paul Tarau, Koen De Bosschere, Bart Demoen

Publication date 17 March 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(96)00105-7

zbMATH Keywords

delphi lemmas

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• Subset-logic programs and their implementation
• Automated Deduction – CADE-20
• scientific article; zbMATH DE number 440117
• scientific article; zbMATH DE number 4104373

Cited in

(2)

• The BinProlog experience: architecture and implementation choices for continuation passing Prolog and first-class logic engines
• On the semantics of deliberation in IndiGolog -- from theory to implementation

This page was built for publication: On Delphi lemmas and other memoing techniques for deterministic logic programs

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