Speedup of logic programs by binarization and partial deduction

DOI10.1017/S147106840300190XzbMATH Open1093.68557OpenAlexW2137485986MaRDI QIDQ4669648FDOQ4669648

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

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

zbMATH Keywords

continuationtransformationbinarizationpartial deductionlogic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (6)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines

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)