On the public citation graph

A sequent-style model elimination strategy and a positive refinement

https://doi.org/10.1007/bf00244355
0 signed · 32 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/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/bf00244944openalex-snapshot
Non-Horn clause logic programming without contrapositives
inferredcites →https://doi.org/10.1007/bf00297245openalex-snapshot
A prolog technology theorem prover: Implementation by an extended prolog compiler
inferredcites →https://doi.org/10.1016/0004-3702(82)90041-8openalex-snapshot
A simplified problem reduction format
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1145/321526.321527openalex-snapshot
A Simplified Format for the Model Elimination Theorem-Proving Procedure
inferredcites →https://doi.org/10.21236/ada185172openalex-snapshot
Near-Horn 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-48317-9_3openalex-snapshot
A Taxonomy of Theorem-Proving Strategies
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_121openalex-snapshot
How well are non-horn clauses handled?
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_7openalex-snapshot
Model elimination without contrapositives
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_24openalex-snapshot
Issues in theorem proving based on the connection method
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_35openalex-snapshot
Link deletion in model elimination
inferred← citeshttps://doi.org/10.1007/3-540-59338-1_36openalex-snapshot
Specifications of inference rules and their automatic translation
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_97openalex-snapshot
Optimizing proof search in model elimination
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_7openalex-snapshot
Specifications of Inference Rules: Extensions of the PTTP Technique
inferred← citeshttps://doi.org/10.1007/bf00249353openalex-snapshot
Near-Horn Prolog and beyond
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf00881843openalex-snapshot
TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
inferred← citeshttps://doi.org/10.1007/bf00881948openalex-snapshot
Model elimination without contrapositives and its application to PTTP
inferred← citeshttps://doi.org/10.1007/bf00881955openalex-snapshot
Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
inferred← citeshttps://doi.org/10.1007/bf01530763openalex-snapshot
Avoiding duplicate proofs with the foothold refinement
inferred← citeshttps://doi.org/10.1007/bf01530821openalex-snapshot
Near-Horn Prolog and the ancestry family of procedures
inferred← citeshttps://doi.org/10.1007/bf02945765openalex-snapshot
On the complexities of non-Horn Clause logic programming
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90044-xopenalex-snapshot
A semantic backward chaining proof system
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90168-fopenalex-snapshot
A Prolog technology theorem prover: a new exposition and implementation in Prolog
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50005-9openalex-snapshot
Tableaux and Related Methods
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.11.001openalex-snapshot
Towards a unified model of search in theorem-proving: subgoal-reduction strategies
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00007-6openalex-snapshot
Non-Horn clause logic programming
inferred← citeshttps://doi.org/10.1023/a:1005812703468openalex-snapshot
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion
inferred← citeshttps://doi.org/10.48456/tr-286openalex-snapshot
Isabelle’s object-logics
inferred← citeshttps://doi.org/10.4995/thesis/10251/6023openalex-snapshot
Resolución SL*: Un paradigma basado en resolución lineal para la demostración automática
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.