On the public citation graph
Logic Programming and Automated Reasoning
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/bfb0013062openalex-snapshot
Building proofs by analogy via the Curry-Howard Isomorphism
inferredcites →https://doi.org/10.1007/bfb0013063openalex-snapshot
On the use of the constructive omega-rule within automated deduction
inferredcites →https://doi.org/10.1007/bfb0013068openalex-snapshot
Non-clausal resolution and superposition with selection and redundancy criteria
inferredcites →https://doi.org/10.1007/bfb0013074openalex-snapshot
Netlog — A concept oriented logic programming language
inferredcites →https://doi.org/10.1007/bfb0013075openalex-snapshot
From the past to the future: Executing temporal logic programs
inferredcites →https://doi.org/10.1007/bfb0013080openalex-snapshot
Unification in order-sorted type theory
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-61286-6_145openalex-snapshot
Signed formula logic programming: Operational semantics and applications (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-7091-6461-7_6openalex-snapshot
Algorithm animation with Agat
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00212-4openalex-snapshot
The shortest single axioms for groups of exponent 4
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50027-9openalex-snapshot
Deriving Correctness Properties of Compiled Code
inferred← citeshttps://doi.org/10.1016/j.apal.2015.01.002openalex-snapshot
Inductive theorem proving based on tree grammars
inferred← citeshttps://doi.org/10.1016/j.apal.2023.103341openalex-snapshot
Towards logical foundations for probabilistic computation
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.002openalex-snapshot
Strong normalization of the second-order symmetric λμ-calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.010openalex-snapshot
Superposition with equivalence reasoning and delayed clause normal form transformation
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.002openalex-snapshot
The meaning of infinity in calculus and computer algebra systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.003openalex-snapshot
Unprovability results for clause set cycles
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80007-8openalex-snapshot
Classical logic and control operators
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00244-8openalex-snapshot
Representing scope in intuitionistic deductions
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80417-7openalex-snapshot
Computational isomorphisms in classical 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.