Pages that link to "Item:Q3988796"
From MaRDI portal
The following pages link to Partial evaluation in logic programming (Q3988796):
Displayed 49 items.
- Unfold/fold transformations for disjunctive logic programs (Q287026) (← links)
- Partial evaluation of string obfuscations for Java malware detection (Q511016) (← links)
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q671683) (← links)
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- S-semantics for logic programming: a retrospective look (Q1035702) (← links)
- An improved reductant calculus using fuzzy partial evaluation techniques (Q1037854) (← links)
- Speeding up inferences using relevance reasoning: a formalism and algorithms (Q1127352) (← links)
- An analysis of loop checking mechanisms for logic programs (Q1177923) (← links)
- Generalizing completeness results for loop checks in logic programming (Q1199926) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Mixtus: An automatic partial evaluator for full Prolog (Q1313369) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation (Q1322838) (← links)
- The role of standardising apart in logic programming (Q1329744) (← links)
- Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
- Specialisation calculus and communication (Q1818001) (← links)
- A sound and complete semantics for a version of negation as failure (Q1824413) (← links)
- Nonrecursive incremental evaluation of Datalog queries (Q1924723) (← links)
- Explanations as programs in probabilistic logic programming (Q2163172) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus (Q2628297) (← links)
- Probabilistic logic programming for hybrid relational domains (Q2630824) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- Efficient Reductants Calculi using Partial Evaluation Techniques with Thresholding (Q2867961) (← links)
- A Study on the Practicality of Poly-Controlled Partial Evaluation (Q2873793) (← links)
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
- Generating Specialized Interpreters for Modular Structural Operational Semantics (Q3453654) (← links)
- A positive supercompiler (Q4339016) (← links)
- (Q4499250) (← links)
- (Q4499254) (← links)
- An assumption-based truth maintenance system dealing with non-ground justifications (Q4880539) (← links)
- Annotation of logic programs for independent AND-parallelism by partial evaluation (Q4911136) (← links)
- Proving the correctness of recursion-based automatic program transformations (Q5096758) (← links)
- Concolic Testing in CLP (Q5140007) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Linking Data to Ontologies (Q5445729) (← links)
- Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation (Q5504591) (← links)
- The narrowing-driven approach to functional logic program specialization (Q5957056) (← links)
- Loop checks for logic programs with functions (Q5958765) (← links)
- Symbolic Specialization of Rewriting Logic Theories with <tt>Presto</tt> (Q6063888) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
- Optimizing Maude programs via program specialization (Q6175104) (← links)