Pages that link to "Item:Q3988796"

The following pages link to Partial evaluation in logic programming (Q3988796):

Displaying 50 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)
• Partial-predicate logic in computer science (Q1079560) (← links)
• Partial evaluation and \(\omega\)-completeness of algebraic specifications (Q1084849) (← links)
• Partial evaluation of metaprograms in a ``multiple worlds'' logic language (Q1108779) (← links)
• Partial evaluation with inference rules (Q1108781) (← 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)
• Cost-augmented partial evaluation of functional logic programs (Q1768472) (← links)
• Correctness of on-line partial evaluation for a Pascal-like language (Q1806129) (← links)
• Theory of partial-order programming (Q1806132) (← 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)
• An efficient reasoning method on logic programming using partial evaluation in vector spaces (Q3382822) (← links)
• Generating Specialized Interpreters for Modular Structural Operational Semantics (Q3453654) (← links)
• Decomposability and its role in parallel logic-program evaluation (Q3988801) (← links)
• Supporting Transformations for the Partial Evaluation of Logic Programs (Q4286220) (← links)
• (Q4287481) (← links)
• A positive supercompiler (Q4339016) (← links)
• Partial deduction in disjunctive logic programming (Q4365083) (← 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)