On the public citation graph

Non-clausal resolution and superposition with selection and redundancy criteria

https://doi.org/10.1007/bfb0013068
0 signed · 33 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/978-3-642-66473-1openalex-snapshot
Proof Theory
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1016/0004-3702(82)90011-xopenalex-snapshot
Completely non-clausal theorem proving
inferredcites →https://doi.org/10.1016/s0747-7171(86)80028-1openalex-snapshot
A Structure-preserving Clause Form Translation
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot
Rewrite-based Equational Theorem Proving with Selection and Simplification
inferredcites →https://doi.org/10.1145/321420.321428openalex-snapshot
Automatic Theorem Proving With Renamable and Semantic Resolution
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/357084.357090openalex-snapshot
A Deductive Approach to Program Synthesis
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.1006/inco.1998.2739openalex-snapshot
On the Modelling of Search in Theorem Proving— Towards a Theory of Strategy Analysis
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_15openalex-snapshot
A Model-Based Completeness Proof of Extended Narrowing and Resolution
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-49545-2_8openalex-snapshot
Analysis of Distributed-Search Contraction-Based Strategies
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_17openalex-snapshot
On fairness in distributed automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_26openalex-snapshot
A mechanization of strong Kleene logic for partial functions
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_22openalex-snapshot
Superposition with First-class Booleans and Inprocessing Clausification
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_24openalex-snapshot
Making Higher-Order Superposition Work
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_11openalex-snapshot
Confluence of Terminating Rewriting Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_27openalex-snapshot
Twenty Years Later
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_31openalex-snapshot
Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
inferred← citeshttps://doi.org/10.1007/bf00881910openalex-snapshot
Parallelization of deduction strategies: An analytical study
inferred← citeshttps://doi.org/10.1007/bfb0013043openalex-snapshot
Logic Programming and Automated Reasoning
inferred← citeshttps://doi.org/10.1007/s10817-021-09613-zopenalex-snapshot
Making Higher-Order Superposition Work
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.1023/a:1018919214722openalex-snapshot
A model and a first analysis of distributed‐search contraction‐based strategies
inferred← citeshttps://doi.org/10.1142/9789814533584_0003openalex-snapshot
On the reconstruction of proofs in distributed theorem proving with contraction: a modified Clause-Diffusion method
inferred← citeshttps://doi.org/10.1145/174652.174655openalex-snapshot
Equational inference, canonical proofs, and proof orderings
inferred← citeshttps://doi.org/10.22028/d291-25891openalex-snapshot
A mechanization of sorted higher-order logic based on the resolution principle
inferred← citeshttps://doi.org/10.3233/fi-1995-24128openalex-snapshot
THE CLAUSE-DIFFUSION METHODOLOGY FOR DISTRIBUTED DEDUCTION
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13744openalex-snapshot
The Horn Non-Clausal Class and its Polynomiality
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.