A hybrid approach to conjunctive partial evaluation of logic programs
From MaRDI portal
Recommendations
Cites work
- A general criterion for avoiding infinite unfolding during partial deduction
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions
- A semantic basis for the termination analysis of logic programs
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Fast Offline Partial Evaluation of Large Logic Programs
- scientific article; zbMATH DE number 1953286 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- Partial evaluation in logic programming
Cited in
(9)- Cost-augmented partial evaluation of functional logic programs
- Explanations as programs in probabilistic logic programming
- A framework for computing finite SLD trees
- An efficient reasoning method on logic programming using partial evaluation in vector spaces
- Fast Offline Partial Evaluation of Large Logic Programs
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Conjunctive partial deduction: foundations, control, algorithms, and experiments
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines
- A hybrid approach to online and offline partial evaluation
This page was built for publication: A hybrid approach to conjunctive partial evaluation of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003494)