On the public citation graph

The linked inference principle, I: The formal treatment

https://doi.org/10.1007/bf00244283
0 signed · 49 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_17openalex-snapshot
Hyperparamodulation: A refinement of paramodulation
inferredcites →https://doi.org/10.1007/3-540-10009-1_7openalex-snapshot
Variable elimination and chaining in a resolution-based prover for inequalities
inferredcites →https://doi.org/10.1007/3-540-16780-3_93openalex-snapshot
Negative paramodulation
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_19openalex-snapshot
The Linked Inference Principle, II: The User’s Viewpoint
inferredcites →https://doi.org/10.1007/978-3-322-90102-6openalex-snapshot
Automated Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-55481-0openalex-snapshot
Programming in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_20openalex-snapshot
Eliminating the Irrelevant from Mechanical Proofs
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_15openalex-snapshot
Theorem-Provers Combining Model Elimination and Resolution
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1007/bf00245458openalex-snapshot
Experiments with discrimination-tree indexing and path indexing for term retrieval
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(76)90021-7openalex-snapshot
Refutation graphs
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0743-1066(91)90008-dopenalex-snapshot
Automated theorem proving and logic programming: a natural symbiosis
inferredcites →https://doi.org/10.1016/0898-1221(75)90019-xopenalex-snapshot
An implementation of hyper-resolution
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1016/s0747-7171(89)80012-4openalex-snapshot
Unification theory
inferredcites →https://doi.org/10.1080/00029890.1985.11971545openalex-snapshot
AUTOMATED REASONING
inferredcites →https://doi.org/10.1088/0022-3727/21/3/020openalex-snapshot
Determination of the effective contact radius between a conducting sphere and a thin metallic film
inferredcites →https://doi.org/10.1109/tc.1976.1674698openalex-snapshot
Refutations by Matings
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving
inferredcites →https://doi.org/10.1145/1464052.1464109openalex-snapshot
The unit preference strategy in theorem proving
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321296.321302openalex-snapshot
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
inferredcites →https://doi.org/10.1145/321466.321469openalex-snapshot
Resolution With Merging
inferredcites →https://doi.org/10.1145/321526.321527openalex-snapshot
A Simplified Format for the Model Elimination Theorem-Proving Procedure
inferredcites →https://doi.org/10.1145/321738.321748openalex-snapshot
Z-Resolution: Theorem-Proving with Compiled Axioms
inferredcites →https://doi.org/10.1145/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
inferredcites →https://doi.org/10.2307/2272384openalex-snapshot
J. A. Robinson. Automatic deduction with hyper-resolution. International journal of computer mathematics, vol. 1 no. 3 (1965), pp. 227–234.
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0470018860.s00060openalex-snapshot
Resolution Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_19openalex-snapshot
The Linked Inference Principle, II: The User’s Viewpoint
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_14openalex-snapshot
PTTP and Linked Inference
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_15openalex-snapshot
Automated Reasoning and Bledsoe’s Dream for the Field
inferred← citeshttps://doi.org/10.1007/bf00252178openalex-snapshot
Using hints to increase the effectiveness of an automated reasoning program: Case studies
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf01543481openalex-snapshot
The application of automated reasoning to questions in mathematics and logic
inferred← citeshttps://doi.org/10.1016/0167-739x(93)90007-copenalex-snapshot
Automated theorem-proving research in the Fifth Generation Computer Systems Project: Model generation theorem provers
inferred← citeshttps://doi.org/10.1016/s0096-3003(99)00249-0openalex-snapshot
The application of automated reasoning to formal models of combinatorial optimization
inferred← citeshttps://doi.org/10.1023/a:1005882724254openalex-snapshot
Subgoal Strategies for Solving Board Puzzles
inferred← citeshttps://doi.org/10.1023/a:1005909914693openalex-snapshot
The Hot List Strategy
inferred← citeshttps://doi.org/10.1023/a:1010635625063openalex-snapshot
Finding Shortest Proofs: An Application of Linked Inference Rules
inferred← citeshttps://doi.org/10.1023/a:1010639725972openalex-snapshot
Solving Open Questions and Other Challenge Problems Using Proof Sketches
inferred← citeshttps://doi.org/10.1109/hase.1999.809501openalex-snapshot
A synchronous paradigm for modeling stable reactive systems
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.2172/565657openalex-snapshot
Experiments with the hot list strategy
inferred← citeshttps://doi.org/10.2172/822573openalex-snapshot
OTTER 3.3 reference manual.
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.