On the public citation graph

Exponential improvement of efficient backtracking

0 signed · 18 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-10009-1_24openalex-snapshot

Selective backtracking for logic programs

inferredcites →https://doi.org/10.1007/bfb0060620openalex-snapshot

Symposium on Automatic Demonstration

inferredcites →https://doi.org/10.1007/bfb0060630openalex-snapshot

A linear format for resolution

inferredcites →https://doi.org/10.1007/bfb0060631openalex-snapshot

Refinement theorems in resolution theory

inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot

Symbolic Logic and Mechanical Theorem Proving

inferredcites →https://doi.org/10.1109/tpami.1981.4767050openalex-snapshot

Deduction Plans: A Basis for Intelligent Backtracking

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-16442-1_24openalex-snapshot

A very intelligent backtracking method for Logic Programs

inferred← citeshttps://doi.org/10.1007/3-540-16492-8_68openalex-snapshot

Intractable unifiability problems and backtracking

inferred← citeshttps://doi.org/10.1007/3-540-16780-3_101openalex-snapshot

Parallel theorem proving with connection graphs

inferred← citeshttps://doi.org/10.1007/3-540-16780-3_104openalex-snapshot

An improvement of deduction plans: Refutation plans

inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_25openalex-snapshot

Implementation Strategies for Plan-Based Deduction

inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_17openalex-snapshot

Übersetzung logischer Programmiersprachen

inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_5openalex-snapshot

Implementation Issues of Logic Programming Languages

inferred← citeshttps://doi.org/10.1007/bf03037439openalex-snapshot

Maximal unifiable subsets and minimal nonunifiable subsets

inferred← citeshttps://doi.org/10.1007/bfb0000063openalex-snapshot

Exponential improvement of exhaustive backtracking: data structure and implementation

inferred← citeshttps://doi.org/10.1016/0743-1066(87)90021-5openalex-snapshot

On determining the causes of nonunifiability

inferred← citeshttps://doi.org/10.1023/a:1022614725002openalex-snapshot

Information Filtering: Selection Mechanisms in Learning Systems

inferred← citeshttps://doi.org/10.1145/62029.62030openalex-snapshot

Unification: a multidisciplinary survey

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.