On the public citation graph
An average case analysis of a resolution principle algorithm in mechanical theorem proving
0 signed · 35 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.1007/bf01874393openalex-snapshot
Probabilistic analysis of the pure literal heuristic for the satisfiability problem
inferredcites →https://doi.org/10.1016/0020-0190(82)90110-7openalex-snapshot
Average time analysis of simplified Davis-Putnam procedures
inferredcites →https://doi.org/10.1016/0020-0190(86)90051-7openalex-snapshot
On the probabilistic performance of algorithms for the satisfiability problem
inferredcites →https://doi.org/10.1016/0020-0255(87)90003-xopenalex-snapshot
Polynomial-average-time satisfiability problems
inferredcites →https://doi.org/10.1016/0020-0255(90)90030-eopenalex-snapshot
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1016/0304-3975(77)90054-8openalex-snapshot
On the complexity of regular resolution and the Davis-Putnam procedure
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0004-3702(83)80007-1openalex-snapshot
Search rearrangement backtracking and polynomial average time
inferredcites →https://doi.org/10.1137/0210043openalex-snapshot
An Average Time Analysis of Backtracking
inferredcites →https://doi.org/10.1137/0212049openalex-snapshot
An Analysis of Backtracking with Search Rearrangement
inferredcites →https://doi.org/10.1137/0214067openalex-snapshot
The Pure Literal Rule and Polynomial Average Time
inferredcites →https://doi.org/10.1137/0215080openalex-snapshot
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
inferredcites →https://doi.org/10.1137/0218026openalex-snapshot
CNF-Satisfiability Test by Counting and Polynomial Average Time
inferredcites →https://doi.org/10.1137/0218028openalex-snapshot
Exponential Average Time for the Pure Literal Rule
inferredcites →https://doi.org/10.1137/0402046openalex-snapshot
Average Performance of Heuristics for Satisfiability
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321160.321166openalex-snapshot
Theorem-Proving on the Computer
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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-54945-5_55openalex-snapshot
An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/bfb0023765openalex-snapshot
Some aspects of the probabilistic behavior of variants of resolution
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90177-wopenalex-snapshot
Solving the satisfiability problem by using randomized approach
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
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.