Partial evaluation in logic programming
From MaRDI portal
Publication:3988796
DOI10.1016/0743-1066(91)90027-MzbMath0741.68030OpenAlexW2037035101MaRDI QIDQ3988796
John W. Lloyd, John C. Shepherdson
Publication date: 28 June 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(91)90027-m
Related Items (49)
The role of standardising apart in logic programming ⋮ Unfold/fold transformations for disjunctive logic programs ⋮ On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Probabilistic logic programming for hybrid relational domains ⋮ Generating Specialized Interpreters for Modular Structural Operational Semantics ⋮ Explanations as programs in probabilistic logic programming ⋮ Speeding up inferences using relevance reasoning: a formalism and algorithms ⋮ Optimization of rewrite theories by equational partial evaluation ⋮ Nonrecursive incremental evaluation of Datalog queries ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Optimizing Maude programs via program specialization ⋮ Closed-form upper bounds in static cost analysis ⋮ A positive supercompiler ⋮ Fast offline partial evaluation of logic programs ⋮ An assumption-based truth maintenance system dealing with non-ground justifications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Concolic Testing in CLP ⋮ An analysis of loop checking mechanisms for logic programs ⋮ A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs ⋮ Proving the correctness of recursion-based automatic program transformations ⋮ Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs ⋮ Partial evaluation of string obfuscations for Java malware detection ⋮ Abstract conjunctive partial deduction for the analysis and compilation of coroutines ⋮ Annotation of logic programs for independent AND-parallelism by partial evaluation ⋮ Generalizing completeness results for loop checks in logic programming ⋮ A general criterion for avoiding infinite unfolding during partial deduction ⋮ A framework for computing finite SLD trees ⋮ Linking Data to Ontologies ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Loop checks for logic programs with functions ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ The applicability of logic program analysis and transformation to theorem proving ⋮ Proving the correctness of recursion-based automatic program transformations ⋮ Specialisation calculus and communication ⋮ A sound and complete semantics for a version of negation as failure ⋮ S-semantics for logic programming: a retrospective look ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ Loop checking in SLD-derivations by well-quasi-ordering of goals ⋮ Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation ⋮ Mixtus: An automatic partial evaluator for full Prolog ⋮ Efficient Reductants Calculi using Partial Evaluation Techniques with Thresholding ⋮ A compositional semantics for logic programs ⋮ Sound and complete partial deduction with unfolding based on well-founded measures ⋮ A Study on the Practicality of Poly-Controlled Partial Evaluation ⋮ Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation ⋮ Derivation of efficient logic programs by specialization and reduction of nondeterminism
This page was built for publication: Partial evaluation in logic programming
