On the public citation graph
A proof procedure with matrix reduction
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1111/j.1755-2567.1960.tb00558.xopenalex-snapshot
An improved proof procedure1
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321450.321456openalex-snapshot
Mechanical Theorem-Proving by Model Elimination
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11425274_19openalex-snapshot
Duality in Knowledge Compilation Techniques
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_104openalex-snapshot
Perspectives on automated deduction
inferred← citeshttps://doi.org/10.1007/3-540-55425-4_2openalex-snapshot
Parallel theorem provers An overview
inferred← citeshttps://doi.org/10.1007/3-540-61208-4_20openalex-snapshot
Proof-search in intuitionistic logic based on constraint satisfaction
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_9openalex-snapshot
Advances in Connection-Based Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_14openalex-snapshot
Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_4openalex-snapshot
Perspectives on Automated Deduction
inferred← citeshttps://doi.org/10.1007/bf00244489openalex-snapshot
Short proofs of the pigeonhole formulas based on the connection method
inferred← citeshttps://doi.org/10.1007/bf00248320openalex-snapshot
On connections and higher-order logic
inferred← citeshttps://doi.org/10.1007/bf01068444openalex-snapshot
A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories
inferred← citeshttps://doi.org/10.1007/bf02239498openalex-snapshot
An approach to a systematic theorem proving procedure in first-order logic
inferred← citeshttps://doi.org/10.1007/bfb0000067openalex-snapshot
Proof by matrix reduction as plan + validation
inferred← citeshttps://doi.org/10.1007/bfb0027412openalex-snapshot
Non-elementary speed-ups in proof length by different variants of classical analytic calculi
inferred← citeshttps://doi.org/10.1016/0004-3702(82)90024-8openalex-snapshot
A comparative study of several proof procedures
inferred← citeshttps://doi.org/10.1016/0066-4138(73)90001-3openalex-snapshot
Automatic theorem proving based on resolution
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90054-9openalex-snapshot
Tautology testing with a generalized matrix reduction method
inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferred← citeshttps://doi.org/10.1109/lics.1998.705662openalex-snapshot
Herbrand's theorem, automated reasoning and semantic tableaux
inferred← citeshttps://doi.org/10.1145/174130.174136openalex-snapshot
Factorization and circuit in the connection method
inferred← citeshttps://doi.org/10.1145/23005.23716openalex-snapshot
Inference with path resolution and semantic graphs
inferred← citeshttps://doi.org/10.1145/321694.321706openalex-snapshot
A Unifying View of Some Linear Herbrand Procedures
inferred← citeshttps://doi.org/10.4230/lipics.fscd.2022.19openalex-snapshot
First-order proofs without syntax
inferred← citeshttps://doi.org/10.48550/arxiv.1802.03224openalex-snapshot
Unification nets: canonical proof net quantifiers
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.