On the public citation graph

A general criterion for avoiding infinite unfolding during partial deduction

https://doi.org/10.1007/bf03037527
0 signed · 81 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-52837-7openalex-snapshot
Termination Proofs for Logic Programs
inferredcites →https://doi.org/10.1007/3-540-56282-6_5openalex-snapshot
Tutorial on termination of logic programs
inferredcites →https://doi.org/10.1007/978-1-4612-2360-3openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-1-4684-0357-2openalex-snapshot
First-Order Logic and Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-76274-1_9openalex-snapshot
Studies in Pure Prolog: Termination
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_4openalex-snapshot
Assigning Meanings to Programs
inferredcites →https://doi.org/10.1007/bf01806312openalex-snapshot
Mix: A self-applicable partial evaluator for experiments in compiler generation
inferredcites →https://doi.org/10.1007/bf03037133openalex-snapshot
A self-applicable partial evaluator and its use in incremental compilation
inferredcites →https://doi.org/10.1007/bf03037139openalex-snapshot
Partial evaluation of metaprograms in a “multiple worlds” logic language
inferredcites →https://doi.org/10.1007/bf03037142openalex-snapshot
A partial evaluation system for Prolog: some practical considerations
inferredcites →https://doi.org/10.1007/bf03037167openalex-snapshot
The derivation of an algorithm for program specialisation
inferredcites →https://doi.org/10.1007/bfb0015938openalex-snapshot
The limitations of partial evaluation
inferredcites →https://doi.org/10.1016/0304-3975(94)90203-8openalex-snapshot
Sound and complete partial deduction with unfolding based on well-founded measures
inferredcites →https://doi.org/10.1016/0743-1066(89)90033-2openalex-snapshot
Compiling control
inferredcites →https://doi.org/10.1016/0743-1066(89)90034-4openalex-snapshot
Metainterpreters for expert system construction
inferredcites →https://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1016/s0747-7171(89)80046-xopenalex-snapshot
On the transformation of logic programs with instantiation based computation rules
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.1145/42282.42285openalex-snapshot
Efficient tests for top-down termination of logical rules
inferredcites →https://doi.org/10.7551/mitpress/5510.001.0001openalex-snapshot
The Practice of Prolog

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11506676_10openalex-snapshot
Efficient Local Unfolding with Ancestor Stacks for Full Prolog
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_14openalex-snapshot
Automatic Optimization of Multi-paradigm Declarative Programs
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_17openalex-snapshot
Homeomorphic Embedding for Online Termination of Symbolic Methods
inferred← citeshttps://doi.org/10.1007/3-540-44404-1_24openalex-snapshot
Using an Abstract Representation to Specialize Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_21openalex-snapshot
A Practical Partial Evaluator for a Multi-Paradigm Declarative Language
inferred← citeshttps://doi.org/10.1007/3-540-45350-4_8openalex-snapshot
A New Termination Approach for Specialization
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_36openalex-snapshot
On Termination of Meta-programs
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_35openalex-snapshot
Detecting Optimal Termination Conditions of Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_9openalex-snapshot
Sonic Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_5openalex-snapshot
Logic Program Specialisation
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_11openalex-snapshot
Improving Homeomorphic Embedding for Online Termination
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_14openalex-snapshot
On the Power of Homeomorphic Embedding for Online Termination
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_5openalex-snapshot
Tutorial on termination of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_1openalex-snapshot
Ecological partial deduction: Preserving characteristic trees without constraints
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_8openalex-snapshot
Towards automatic control for CLP(χ) programs
inferred← citeshttps://doi.org/10.1007/3-540-61286-6_135openalex-snapshot
Partial evaluation in Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_12openalex-snapshot
Efficiently generating efficient generating extensions in prolog
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_13openalex-snapshot
Global control for partial deduction through characteristic atoms and global trees
inferred← citeshttps://doi.org/10.1007/3-540-61580-6_18openalex-snapshot
A comparative revisitation of some program transformation techniques
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_83openalex-snapshot
Controlling conjunctive partial deduction
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_16openalex-snapshot
Specialising meta-level compositions of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_5openalex-snapshot
Conjunctive partial deduction in practice
inferred← citeshttps://doi.org/10.1007/978-1-4471-3234-9_14openalex-snapshot
Some Further Issues in Finite Unfolding (Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_45openalex-snapshot
Termination Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_10openalex-snapshot
Proving Termination with Adornments
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_5openalex-snapshot
Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-00515-2_2openalex-snapshot
Test Data Generation of Bytecode by CLP Partial Evaluation
inferred← citeshttps://doi.org/10.1007/bf03037257openalex-snapshot
The narrowing-driven approach to functional logic program specialization
inferred← citeshttps://doi.org/10.1007/bf03037314openalex-snapshot
A program specialiser for meta-level compositions of logic programs
inferred← citeshttps://doi.org/10.1007/bf03037483openalex-snapshot
Constrained partial deduction and the preservation of characteristic trees
inferred← citeshttps://doi.org/10.1007/bfb0053561openalex-snapshot
A polyvariant binding-time analysis for off-line partial deduction
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00227-aopenalex-snapshot
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90203-8openalex-snapshot
Sound and complete partial deduction with unfolding based on well-founded measures
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.01.008openalex-snapshot
A Study on the Practicality of Poly-Controlled Partial Evaluation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.11.006openalex-snapshot
A framework for computing finite SLD trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.033openalex-snapshot
Rules + strategies for transforming lazy functional logic programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00197-3openalex-snapshot
Loop checks for logic programs with functions
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10012-7openalex-snapshot
Creating specialised integrity checks through partial evaluation of meta-interpreters
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00030-8openalex-snapshot
Conjunctive partial deduction: foundations, control, algorithms, and experiments
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1017/s1471068409990068openalex-snapshot
Termination prediction for general logic programs
inferred← citeshttps://doi.org/10.1017/s1471068409990263openalex-snapshot
Efficient local unfolding with ancestor stacks
inferred← citeshttps://doi.org/10.1023/b:lisp.0000029447.02190.42openalex-snapshot
Cost-Augmented Partial Evaluation of Functional Logic Programs
inferred← citeshttps://doi.org/10.1109/icsmc.2002.1167972openalex-snapshot
A partial evaluation tool for multi-paradigm declarative languages
inferred← citeshttps://doi.org/10.1145/1140335.1140366openalex-snapshot
Poly-controlled partial evaluation
inferred← citeshttps://doi.org/10.1145/1244381.1244407openalex-snapshot
Poly-controlled partial evaluation in practice
inferred← citeshttps://doi.org/10.1145/271510.271525openalex-snapshot
Controlling generalization and polyvariance in partial deduction of normal logic programs
inferred← citeshttps://doi.org/10.1145/289121.289125openalex-snapshot
Some achievements and prospects in partial deduction
inferred← citeshttps://doi.org/10.1145/291891.291896openalex-snapshot
Partial evaluation of functional logic programs
inferred← citeshttps://doi.org/10.1145/503032.503037openalex-snapshot
Cost-augmented narrowing-driven specialization
inferred← citeshttps://doi.org/10.1145/509799.503037openalex-snapshot
Cost-augmented narrowing-driven specialization
inferred← citeshttps://doi.org/10.1145/982158.982159openalex-snapshot
A framework for the integration of partial evaluation and abstract interpretation of logic programs
inferred← citeshttps://doi.org/10.20868/upm.thesis.329openalex-snapshot
Poly-controlled partial evaluation and its application to resource-aware program specialization
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0006031openalex-snapshot
Verifying Termination of General Logic Programs with Concrete Queries
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512055openalex-snapshot
Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.