On the public citation graph

Contributions to the semantics of logic perpetual processes

https://doi.org/10.1007/bf00291055
0 signed · 30 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-10699-5_114openalex-snapshot
An extension to horn clause logic allowing the definition of concurrent processes
inferredcites →https://doi.org/10.1007/3-540-11494-7_1openalex-snapshot
Applicative communicating processes in first order logic
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-16479-0_17openalex-snapshot
Guarded horn clauses
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf03037020openalex-snapshot
Object oriented programming in Concurrent Prolog
inferredcites →https://doi.org/10.1016/0167-8051(82)90048-1openalex-snapshot
Proceedings of the international conference on fifth-generation computer systems
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(84)90017-3openalex-snapshot
Closures and fairness in the semantics of programming logic
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0743-1066(85)90005-6openalex-snapshot
Top-down semantics of fair computations of logic programs
inferredcites →https://doi.org/10.1016/s0019-9958(84)80021-2openalex-snapshot
A synchronization logic: Axiomatics and formal semantics of generalized horn clauses
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/5001.5390openalex-snapshot
PARLOG: parallel programming in logic
inferredcites →https://doi.org/10.1145/800223.806776openalex-snapshot
A relational language for parallel programming

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_152openalex-snapshot
Semantics for logic programs without occur check
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_23openalex-snapshot
Logic Programming and Co-inductive Definitions
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_1openalex-snapshot
Potentiality of parallelism in logic
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_13openalex-snapshot
A logical denotational semantics for constraint logic programming
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_13openalex-snapshot
A Coalgebraic Approach to Unification Semantics of Logic Programming
inferred← citeshttps://doi.org/10.1007/s002360050095openalex-snapshot
A survey of stream processing
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90194-mopenalex-snapshot
Semantics for logic programs without occur check
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00047-zopenalex-snapshot
Nondeterminism and infinite computations in constraint programming
inferred← citeshttps://doi.org/10.1093/logcom/12.2.321openalex-snapshot
On Greatest Fixpoint Semantics of Logic Programming
inferred← citeshttps://doi.org/10.20965/jaciii.2007.p0176openalex-snapshot
Infinite Computation in the Equivalent Transformation Model
inferred← citeshttps://doi.org/10.23889/suthesis.57505openalex-snapshot
Algebraic Stream Processing
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09909openalex-snapshot
Coinduction Plain and Simple
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.