A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs

DOI10.1007/978-3-642-20551-4_13zbMath1326.68064OpenAlexW1593038886MaRDI QIDQ3003494

Germán Vidal

Publication date: 27 May 2011

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

Full work available at URL: http://hdl.handle.net/10251/37391

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (4)

Explanations as programs in probabilistic logic programming ⋮ Abstract conjunctive partial deduction for the analysis and compilation of coroutines ⋮ Annotation of logic programs for independent AND-parallelism by partial evaluation ⋮ A framework for computing finite SLD trees

Uses Software

• LOGEN
• ECCE
• DPPD

Cites Work

• Unnamed Item
• Unnamed Item
• A general criterion for avoiding infinite unfolding during partial deduction
• Fast Offline Partial Evaluation of Large Logic Programs
• Partial evaluation in logic programming
• A semantic basis for the termination analysis of logic programs
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions

This page was built for publication: A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs