Partial evaluation in logic programming
From MaRDI portal
Recommendations
- Supporting Transformations for the Partial Evaluation of Logic Programs
- Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
- Partial evaluation of metaprograms in a ``multiple worlds logic language
- scientific article; zbMATH DE number 2032417
- Fast offline partial evaluation of logic programs
Cited in
(67)- S-semantics for logic programming: a retrospective look
- An improved reductant calculus using fuzzy partial evaluation techniques
- Partial-predicate logic in computer science
- Partial evaluation and \(\omega\)-completeness of algebraic specifications
- Partial evaluation of metaprograms in a ``multiple worlds logic language
- Partial evaluation with inference rules
- Speeding up inferences using relevance reasoning: a formalism and algorithms
- An analysis of loop checking mechanisms for logic programs
- Generalizing completeness results for loop checks in logic programming
- A general criterion for avoiding infinite unfolding during partial deduction
- Mixtus: An automatic partial evaluator for full Prolog
- A compositional semantics for logic programs
- Sound and complete partial deduction with unfolding based on well-founded measures
- Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
- The role of standardising apart in logic programming
- Loop checking in SLD-derivations by well-quasi-ordering of goals
- Cost-augmented partial evaluation of functional logic programs
- Theory of partial-order programming
- Specialisation calculus and communication
- A sound and complete semantics for a version of negation as failure
- Nonrecursive incremental evaluation of Datalog queries
- Explanations as programs in probabilistic logic programming
- A framework for computing finite SLD trees
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Closed-form upper bounds in static cost analysis
- Fast offline partial evaluation of logic programs
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
- Probabilistic logic programming for hybrid relational domains
- Optimization of rewrite theories by equational partial evaluation
- scientific article; zbMATH DE number 1629816 (Why is no real title available?)
- scientific article; zbMATH DE number 1692905 (Why is no real title available?)
- Efficient reductants calculi using partial evaluation techniques with thresholding
- Unfold/fold transformations for disjunctive logic programs
- A study on the practicality of poly-controlled partial evaluation
- A hybrid approach to conjunctive partial evaluation of logic programs
- An efficient reasoning method on logic programming using partial evaluation in vector spaces
- Generating specialized interpreters for modular structural operational semantics
- scientific article; zbMATH DE number 3978352 (Why is no real title available?)
- Decomposability and its role in parallel logic-program evaluation
- Supporting Transformations for the Partial Evaluation of Logic Programs
- scientific article; zbMATH DE number 549962 (Why is no real title available?)
- A positive supercompiler
- Partial deduction in disjunctive logic programming
- scientific article; zbMATH DE number 1497828 (Why is no real title available?)
- scientific article; zbMATH DE number 1497831 (Why is no real title available?)
- An assumption-based truth maintenance system dealing with non-ground justifications
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Partial order programming (revisited)
- Proving the correctness of recursion-based automatic program transformations
- Partial evaluation of string obfuscations for Java malware detection
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines
- Concolic testing in CLP
- The applicability of logic program analysis and transformation to theorem proving
- Partial deduction for structured logic programming
- Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
- Linking Data to Ontologies
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
- The narrowing-driven approach to functional logic program specialization
- Loop checks for logic programs with functions
- 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
- Proving the correctness of recursion-based automatic program transformations
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs
- Two applications of logic programming to Coq
- Derivation of efficient logic programs by specialization and reduction of nondeterminism
This page was built for publication: Partial evaluation in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988796)
