On the public citation graph
A partial evaluation system for Prolog: some practical considerations
0 signed · 22 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-70840-4_27openalex-snapshot
The Centralised Scheduler vs. The Distributed Specialists: Towards a Flexible Controller in Prolog for Expert Systems
inferredcites →https://doi.org/10.1007/bf03037325openalex-snapshot
Towards a pipelined Prolog processor
inferredcites →https://doi.org/10.1145/2422.2423openalex-snapshot
On compiling queries in recursive first-order databases
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_8openalex-snapshot
Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_20openalex-snapshot
Processing of ground regular terms in Prolog
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_16openalex-snapshot
Semantics—based Partial Evaluation of Prolog Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3494-7_17openalex-snapshot
Prolog Program Transformations and Meta-Interpreters
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_13openalex-snapshot
Applications of Unfolding in Prolog Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-3560-9_14openalex-snapshot
An Unfold Rule for Full Prolog
inferred← citeshttps://doi.org/10.1007/bf01887205openalex-snapshot
Meta-interpreters and partial evaluation in Parlog
inferred← citeshttps://doi.org/10.1007/bf03037137openalex-snapshot
Partial evaluation with inference rules
inferred← citeshttps://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferred← citeshttps://doi.org/10.1007/bf03037527openalex-snapshot
A general criterion for avoiding infinite unfolding during partial deduction
inferred← citeshttps://doi.org/10.1007/bf03038271openalex-snapshot
Mixtus: An automatic partial evaluator for full Prolog
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(95)00149-2openalex-snapshot
Automatic finite unfolding using well-founded measures
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90100-nopenalex-snapshot
Static analysis of a parallel logic language based on the blackboard model
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.11.024openalex-snapshot
Oracle-Based Partial Evaluation
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1017/s1471068409990263openalex-snapshot
Efficient local unfolding with ancestor stacks
inferred← citeshttps://doi.org/10.1145/1069774.1069777openalex-snapshot
Self-tuning resource aware specialisation for prolog
inferred← citeshttps://doi.org/10.4204/eptcs.341.5openalex-snapshot
An Empirical Study of Partial Deduction for miniKanren
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.