Fast Frequent Querying with Lazy Control Flow Compilation

DOI10.1017/S1471068406002894MaRDI QIDQ5297633zbMATH OpenOpenAlexFDO

Authors Remko Tronçon, Gerda Janssens, Bart Demoen, Henk Vandecasteele

Publication date 12 July 2007

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

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

zbMATH Keywords

compilationinductive logic programminglogic programmingWarren abstract machine

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20)

Recommendations

• Logic Programming
• scientific article; zbMATH DE number 1759245
• Compiling control
• Compile the hypothesis space: do it once, use it often
• Optimizing general chain programs

Cites work

• Top-down induction of first-order logical decision trees

Cited in

(1)

• Logic Programming

This page was built for publication: Fast Frequent Querying with Lazy Control Flow Compilation

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