On the public citation graph

A new data structure for implementing extensions to Prolog

https://doi.org/10.1007/bfb0024181
0 signed · 29 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/10704567_7openalex-snapshot
Compiling Constraint Handling Rules into Prolog with Attributed Variables
inferred← citeshttps://doi.org/10.1007/3-540-40888-6_17openalex-snapshot
Numeric Constraint Resolution in Logic Programming Based on Subdefinite Models
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_32openalex-snapshot
A System for Tabled Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_19openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_1openalex-snapshot
Real-time memory management for Prolog
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_126openalex-snapshot
Binding techniques and garbage collection for OR-parallel CLP systems
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_141openalex-snapshot
Metastructures vs. attributed variables in the context of extensible unification
inferred← citeshttps://doi.org/10.1007/3-540-56454-3_16openalex-snapshot
An architecture for Prolog extensions
inferred← citeshttps://doi.org/10.1007/3-540-58601-6_95openalex-snapshot
Some methodological issues in the design of CIAO, a generic, parallel concurrent constraint logic programming system
inferred← citeshttps://doi.org/10.1007/3-540-61291-2_63openalex-snapshot
Reference constraints and individual level inheritance
inferred← citeshttps://doi.org/10.1007/bf00137870openalex-snapshot
Interval propagation to reason about sets: Definition and implementation of a practical language
inferred← citeshttps://doi.org/10.1007/bfb0002871openalex-snapshot
Improving distributed unification through type analysis
inferred← citeshttps://doi.org/10.1007/bfb0017184openalex-snapshot
Dynamic memory management for sequential logic programming languages
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80109-4openalex-snapshot
Attributed Variables in XSB
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80016-7openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80018-0openalex-snapshot
Finite Domain Constraint Programming Systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80021-0openalex-snapshot
Constraints over Structured Domains
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/s1471068402001618openalex-snapshot
An open ended tree
inferred← citeshttps://doi.org/10.1017/s1471068412000336openalex-snapshot
Lightweight compilation of (C)LP to JavaScript
inferred← citeshttps://doi.org/10.1017/s1471068413000331openalex-snapshot
Delimited continuations for prolog
inferred← citeshttps://doi.org/10.1017/s1471068414000143openalex-snapshot
The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information
inferred← citeshttps://doi.org/10.1145/1836089.1836102openalex-snapshot
Towards a jitting VM for prolog execution
inferred← citeshttps://doi.org/10.1145/351268.351296openalex-snapshot
Efficient memory management in a merged heap/stack prolog machine
inferred← citeshttps://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferred← citeshttps://doi.org/10.4204/eptcs.234.10openalex-snapshot
A Framework for Extending microKanren with Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2801openalex-snapshot
The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information
inferred← citeshttps://doi.org/10.48550/arxiv.1405.4008openalex-snapshot
CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0062openalex-snapshot
Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems
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.