On the public citation graph

Constrained partial deduction and the preservation of characteristic trees

https://doi.org/10.1007/bf03037483
0 signed · 68 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.1006/inco.1995.1048openalex-snapshot
Negation and Constraint Logic Programming
inferredcites →https://doi.org/10.1007/3-540-19129-1_4openalex-snapshot
Unification Revisited
inferredcites →https://doi.org/10.1007/3-540-56282-6openalex-snapshot
Meta-Programming in Logic
inferredcites →https://doi.org/10.1007/3-540-56282-6_4openalex-snapshot
An introduction to partial deduction
inferredcites →https://doi.org/10.1007/3-540-58156-1_15openalex-snapshot
The applicability of logic program analysis and transformation to theorem proving
inferredcites →https://doi.org/10.1007/3-540-58792-6_8openalex-snapshot
Partial evaluation of the “real thing”
inferredcites →https://doi.org/10.1007/3-540-60939-3_1openalex-snapshot
Ecological partial deduction: Preserving characteristic trees without constraints
inferredcites →https://doi.org/10.1007/3-540-61580-6_13openalex-snapshot
Global control for partial deduction through characteristic atoms and global trees
inferredcites →https://doi.org/10.1007/3-540-61756-6_83openalex-snapshot
Controlling conjunctive partial deduction
inferredcites →https://doi.org/10.1007/3-540-62718-9_5openalex-snapshot
Conjunctive partial deduction in practice
inferredcites →https://doi.org/10.1007/3-540-62718-9_6openalex-snapshot
Redundant argument filtering of logic programs
inferredcites →https://doi.org/10.1007/978-1-4471-3494-7_15openalex-snapshot
Specialisation of a Unification Algorithm
inferredcites →https://doi.org/10.1007/978-1-4471-3560-9_11openalex-snapshot
Deletion of Redundant Unary Type Predicates from Logic Programs
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-010-0526-5_18openalex-snapshot
Language and Equality Theory in Logic Programming
inferredcites →https://doi.org/10.1007/bf00047165openalex-snapshot
Journal of automated reasoning
inferredcites →https://doi.org/10.1007/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1007/bf01185404openalex-snapshot
What is failure? An approach to constructive negation
inferredcites →https://doi.org/10.1007/bf03037167openalex-snapshot
The derivation of an algorithm for program specialisation
inferredcites →https://doi.org/10.1007/bf03037527openalex-snapshot
A general criterion for avoiding infinite unfolding during partial deduction
inferredcites →https://doi.org/10.1007/bf03038271openalex-snapshot
Mixtus: An automatic partial evaluator for full Prolog
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(87)90007-0openalex-snapshot
Negation in logic programming
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/0743-1066(93)90022-9openalex-snapshot
Loop checking in partial deduction
inferredcites →https://doi.org/10.1016/0743-1066(93)90025-copenalex-snapshot
The loop absorption and the generalization strategies for the development of logic programs and partial deduction
inferredcites →https://doi.org/10.1016/0743-1066(94)00015-xopenalex-snapshot
Why untyped nonground metaprogramming is not (much of) a problem
inferredcites →https://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferredcites →https://doi.org/10.1016/0743-1066(94)90028-0openalex-snapshot
Transformation of logic programs: Foundations and techniques
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/0743-1066(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferredcites →https://doi.org/10.1017/s0956796800000757openalex-snapshot
Program transformation with metasystem transitions
inferredcites →https://doi.org/10.1093/logcom/3.5.469openalex-snapshot
Supporting Transformations for the Partial Evaluation of Logic Programs
inferredcites →https://doi.org/10.1093/logcom/3.5.487openalex-snapshot
Levationis Laus
inferredcites →https://doi.org/10.1093/oso/9780198537922.003.0013openalex-snapshot
Transformation of Logic Programs
inferredcites →https://doi.org/10.1109/lics.1991.151657openalex-snapshot
Constructive negation for constraint logic programming
inferredcites →https://doi.org/10.1145/115865.115873openalex-snapshot
Partial evaluation of pattern matching in constraint logic programming languages
inferredcites →https://doi.org/10.1145/154630.154640openalex-snapshot
Tutorial on specialisation of logic programs
inferredcites →https://doi.org/10.1145/215465.215561openalex-snapshot
Implementation of multiple specialization in logic programs
inferredcites →https://doi.org/10.1145/215465.215598openalex-snapshot
Towards creating specialised integrity checks through partial evaluation of meta-interpreters
inferredcites →https://doi.org/10.1145/359138.359142openalex-snapshot
Proving termination with multiset orderings
inferredcites →https://doi.org/10.1145/5956.5957openalex-snapshot
The concept of a supercompiler
inferredcites →https://doi.org/10.1145/78942.78947openalex-snapshot
A method for specializing logic programs
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0059openalex-snapshot
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0066openalex-snapshot
A Transformation System for Modular CLP Programs
inferredcites →https://doi.org/10.7551/mitpress/4301.003.0048openalex-snapshot
An Algorithm of Generalization in Positive Supercompilation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11680093_6openalex-snapshot
Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_7openalex-snapshot
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_10openalex-snapshot
On Perfect Supercompilation
inferred← citeshttps://doi.org/10.1007/3-540-47018-2_11openalex-snapshot
Advanced Logic Program Specialisation
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-49674-2_9openalex-snapshot
Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_6openalex-snapshot
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
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/s1471068420000216openalex-snapshot
Concolic Testing in CLP
inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot
Analysis and Transformation of Constrained Horn Clauses for Program Verification
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/289121.289136openalex-snapshot
Extending the power of automatic constraint-based partial evaluators
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
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.