Efficient Local Unfolding with Ancestor Stacks for Full Prolog

DOI10.1007/11506676_10MaRDI QIDQ5458800zbMATH OpenOpenAlexFDO

Authors Germán Puebla, Elvira Albert, Manuel Hermenegildo

Publication date 24 April 2008

Published in Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11506676_10

Mathematics Subject Classification ID

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

Recommendations

• Efficient local unfolding with ancestor stacks
• Near-Horn Prolog and the ancestry family of procedures
• Efficient groundness analysis in Prolog
• Declarative local search for predicate logic
• scientific article; zbMATH DE number 3907751
• Efficient full higher-order unification
• scientific article; zbMATH DE number 512885
• scientific article; zbMATH DE number 176531
• A Local Algorithm for Incremental Evaluation of Tabled Logic Programs

Cited in

(7)

• A study on the practicality of poly-controlled partial evaluation
• Efficient local unfolding with ancestor stacks
• Test Data Generation of Bytecode by CLP Partial Evaluation
• Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
• Oracle-based partial evaluation
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
• Type-based homeomorphic embedding for online termination

Describes a project that uses

Uses Software

• ECCE
• Ciao
• CiaoPP

This page was built for publication: Efficient Local Unfolding with Ancestor Stacks for Full Prolog

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