On the public citation graph
A declarative approach for first-order built-in's of Prolog
0 signed · 21 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/3-540-52837-7openalex-snapshot
Termination Proofs for Logic Programs
inferredcites →https://doi.org/10.1007/3540539816_66openalex-snapshot
Proving termination of logic programs by exploiting term properties
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_2openalex-snapshot
A Logical Operational Semantics of Full Prolog: Part III. Built-In Predicates for Files, Terms, Arithmetic and Input-Output
inferredcites →https://doi.org/10.1007/978-3-642-76274-1_9openalex-snapshot
Studies in Pure Prolog: Termination
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.1016/0304-3975(89)90070-4openalex-snapshot
Declarative modeling of the operational behavior of logic languages
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
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-45653-8_45openalex-snapshot
Inference of Termination Conditions for Numerical Loops in Prolog
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_13openalex-snapshot
On Termination of Logic Programs with Floating Point Computations
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_26openalex-snapshot
On termination of constraint logic programs
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_12openalex-snapshot
Characterisations of Termination in Logic Programming
inferred← citeshttps://doi.org/10.1007/s00165-016-0396-9openalex-snapshot
On proving confluence modulo equivalence for Constraint Handling Rules
inferred← citeshttps://doi.org/10.1007/s10817-005-6546-zopenalex-snapshot
Termination of Floating-Point Computations
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00090-9openalex-snapshot
On termination of general logic programs w.R.T. constructive negation
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10035-3openalex-snapshot
Verification of logic programs
inferred← citeshttps://doi.org/10.1017/s1471068402001400openalex-snapshot
Classes of terminating logic programs
inferred← citeshttps://doi.org/10.1017/s1471068404002042openalex-snapshot
Inference of termination conditions for numerical loops in Prolog
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0106053openalex-snapshot
Inference of termination conditions for numerical loops
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.