Speedup of logic programs by binarization and partial deduction

DOI10.1017/S147106840300190XMaRDI QIDQ4669648zbMATH OpenOpenAlexFDO

Authors

Publication date 15 April 2005

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s147106840300190x

zbMATH Keywords

continuationtransformationbinarizationpartial deductionlogic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1696791
• scientific article; zbMATH DE number 1222414
• Supporting Transformations for the Partial Evaluation of Logic Programs
• Transformations of logic programs
• scientific article; zbMATH DE number 440117

Cited in

(6)

• scientific article; zbMATH DE number 4060778 (Why is no real title available?)
• Fast Offline Partial Evaluation of Large Logic Programs
• Explanations as programs in probabilistic logic programming
• An efficient reasoning method on logic programming using partial evaluation in vector spaces
• scientific article; zbMATH DE number 1696791 (Why is no real title available?)
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines

Describes a project that uses

Uses Software

• ECCE

This page was built for publication: Speedup of logic programs by binarization and partial deduction

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