On the public citation graph

A compositional semantics for Concurrent Prolog

https://doi.org/10.1007/bfb0035860
0 signed · 24 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-12896-4_352openalex-snapshot
Compactness in semantics for merge and fair merge
inferredcites →https://doi.org/10.1007/3-540-13345-3_32openalex-snapshot
On the interpretation of infinite computations in logic programming
inferredcites →https://doi.org/10.1007/3-540-19020-1_13openalex-snapshot
Solving reflexive domain equations in a category of complete metric spaces
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1016/0022-0000(89)90027-5openalex-snapshot
Solving reflexive domain equations in a category of complete metric spaces
inferredcites →https://doi.org/10.1016/0304-3975(84)90114-2openalex-snapshot
Linear time and branching time semantics for recursion with merge
inferredcites →https://doi.org/10.1016/0743-1066(85)90014-7openalex-snapshot
A deterministic prolog fixpoint semantics
inferredcites →https://doi.org/10.1016/0743-1066(86)90003-8openalex-snapshot
Quantitative deduction and its fixpoint theory
inferredcites →https://doi.org/10.1016/0743-1066(88)90007-6openalex-snapshot
Denotational and operational semantics for prolog
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/41625.41630openalex-snapshot
The concurrent logic programming language CP: Definition and operational semantics
inferredcites →https://doi.org/10.1184/r1/6608633openalex-snapshot
Problems with concurrent 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/3-540-19488-6_125openalex-snapshot
Contractions in comparing concurrency semantics
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_132openalex-snapshot
Continuation semantics for PROLOG with cut
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_35openalex-snapshot
Towards a process semantics in the logic programming style
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_17openalex-snapshot
A fully abstract model for concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_34openalex-snapshot
Asynchronous rendez-vous in distributed logic programming
inferred← citeshttps://doi.org/10.1007/3540539816_55openalex-snapshot
CCS for OO and LP
inferred← citeshttps://doi.org/10.1007/bfb0032046openalex-snapshot
Algebraic properties of idempotent substitutions
inferred← citeshttps://doi.org/10.1007/bfb0039054openalex-snapshot
On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences
inferred← citeshttps://doi.org/10.1109/lics.1988.5130openalex-snapshot
Fully abstract denotational semantics for flat Concurrent Prolog
inferred← citeshttps://doi.org/10.14569/ijacsa.2012.031002openalex-snapshot
A Semantics for Concurrent Logic Programming Languages Based on Multiple-Valued Logic
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.