On the public citation graph

Resolution games and non-liftable resolution orderings

https://doi.org/10.1007/bfb0022263
0 signed · 26 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-52885-7_105openalex-snapshot
On restrictions of ordered paramodulation with simplification
inferredcites →https://doi.org/10.1007/3-540-56732-1openalex-snapshot
Resolution Methods for the Decision Problem
inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(90)90139-9openalex-snapshot
Completeness of resolution revisited
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1090/s0002-9939-1979-0529224-9openalex-snapshot
Lower Bounds on Herbrand's Theorem
inferredcites →https://doi.org/10.1145/116825.116833openalex-snapshot
Proving refutational completeness of theorem-proving strategies
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
inferredcites →https://doi.org/10.2307/3612165openalex-snapshot
Machine Intelligence 4. Edited by B. Meltzer and D. Michie. Pp. viii, 508. 100s. 1969. (Edinburgh University Press.)

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_11openalex-snapshot
Counting the Number of Equivalent Binary Resolution Proofs
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_12openalex-snapshot
Splitting through New Proposition Symbols
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_2openalex-snapshot
An algorithm for the retrieval of unifiers from discrimination trees
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_33openalex-snapshot
A classification of non-liftable orders for resolution
inferred← citeshttps://doi.org/10.1007/3-540-63385-5_45openalex-snapshot
Restart tableaux with selection function
inferred← citeshttps://doi.org/10.1007/978-3-7091-9461-4_1openalex-snapshot
Resolution Games and Non-Liftable Resolution Orderings
inferred← citeshttps://doi.org/10.1007/bfb0054260openalex-snapshot
A resolution decision procedure for the guarded fragment
inferred← citeshttps://doi.org/10.1007/bfb0054275openalex-snapshot
Rank/activity: A canonical form for binary resolution
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.003openalex-snapshot
Completeness of hyper-resolution via the semantics of disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00013-0openalex-snapshot
Deciding the E+-class by an a posteriori, liftable order
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00092-5openalex-snapshot
Deciding the guarded fragments by resolution
inferred← citeshttps://doi.org/10.1023/a:1005992522805openalex-snapshot
An Algorithm for the Retrieval of Unifiers from Discrimination Trees
inferred← citeshttps://doi.org/10.1023/a:1006241826565openalex-snapshot
Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution
inferred← citeshttps://doi.org/10.1023/a:1026319711838openalex-snapshot
Games as formal tools versus games as explanations in logic and science
inferred← citeshttps://doi.org/10.1093/logcom/6.6.819openalex-snapshot
A-ordered tableaux
inferred← citeshttps://doi.org/10.22028/d291-25703openalex-snapshot
Resolution-based decision procedures for subclasses of first-order 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.