On the public citation graph

Stålmarck’s algorithm as a HOL derived rule

https://doi.org/10.1007/bfb0105407
0 signed · 43 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-57292-9_36openalex-snapshot
Proving formulas through reduction to decidable classes
inferredcites →https://doi.org/10.1007/3-540-58156-1_18openalex-snapshot
The TPTP problem library
inferredcites →https://doi.org/10.1007/bf00121264openalex-snapshot
Hiding propositional constants in BDDs
inferredcites →https://doi.org/10.1007/bf01459101openalex-snapshot
Zum Entscheidungsproblem der mathematischen Logik
inferredcites →https://doi.org/10.1007/bfb0016843openalex-snapshot
Ordered Binary Decision Diagrams and the Davis-Putnam procedure
inferredcites →https://doi.org/10.1016/0167-9236(88)90097-8openalex-snapshot
A quantitative approach to logical inference
inferredcites →https://doi.org/10.1016/0167-9236(88)90128-5openalex-snapshot
Computation-oriented reductions of predicate to propositional logic
inferredcites →https://doi.org/10.1016/b978-0-08-040953-5.50011-8openalex-snapshot
MODELING AND VERIFYING SYSTEMS AND SOFTWARE IN PROPOSITIONAL LOGIC
inferredcites →https://doi.org/10.1016/s1474-6670(17)52173-4openalex-snapshot
Modeling and Verifying Systems and Software in Propositional Logic
inferredcites →https://doi.org/10.1093/comjnl/38.2.162openalex-snapshot
Binary Decision Diagrams as a HOL derived rule
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
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/11576280_23openalex-snapshot
Using Stålmarck’s Algorithm to Prove Inequalities
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_24openalex-snapshot
Formalizing Stålmarck’s Algorithm in Coq
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_21openalex-snapshot
A Certified Polynomial-Based Decision Procedure for Propositional Logic
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_25openalex-snapshot
Experiments with Finite Tree Automata in Coq
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_3openalex-snapshot
Using Decision Procedures with a Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_7openalex-snapshot
A Tutorial on Stålmarck’s Proof Procedure for Propositional Logic
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_3openalex-snapshot
The industrial success of verification tools based on stålmarck's method
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_44openalex-snapshot
Bit-Vector Rewriting with Automatic Rule Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_7openalex-snapshot
An Expressive Model for Instance Decomposition Based Parallel SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7_9openalex-snapshot
LCF-Style Propositional Simplification with BDDs and SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_6openalex-snapshot
A Compressing Translation from Propositional Resolution to Natural Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_17openalex-snapshot
A Method for Symbolic Computation of Abstract Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_23openalex-snapshot
A Generalization of Stålmarck’s Method
inferred← citeshttps://doi.org/10.1007/bfb0014565openalex-snapshot
Using reflection to build efficient and certified decision procedures
inferred← citeshttps://doi.org/10.1007/bfb0017464openalex-snapshot
Programming constraint inference engines
inferred← citeshttps://doi.org/10.1007/s001650050021openalex-snapshot
Case Study: Formal Verification of a Computerized Railway Interlocking
inferred← citeshttps://doi.org/10.1007/s10817-008-9109-2openalex-snapshot
Data Compression for Proof Replay
inferred← citeshttps://doi.org/10.1016/j.jal.2007.07.003openalex-snapshot
Efficiently checking propositional refutations in HOL theorem provers
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00400-6openalex-snapshot
How to fake an RSA signature by encoding modular root finding as a SAT problem
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00331-7openalex-snapshot
Formal Verification based on Boolean Expression Diagrams
inferred← citeshttps://doi.org/10.1023/a:1006326723002openalex-snapshot
Logical Cryptanalysis as a SAT Problem
inferred← citeshttps://doi.org/10.1023/a:1006366304347openalex-snapshot
The Propositional Formula Checker HeerHugo
inferred← citeshttps://doi.org/10.1023/a:1008725524946openalex-snapshot
A Tutorial on Stålmarck's Proof Procedure for Propositional Logic
inferred← citeshttps://doi.org/10.1023/b:amai.0000012871.08577.0bopenalex-snapshot
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1093/jigpal/9.1.1openalex-snapshot
How to avoid the formal verification of a theorem prover
inferred← citeshttps://doi.org/10.1109/date.2003.1253717openalex-snapshot
Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications
inferred← citeshttps://doi.org/10.1109/fpga.1999.803664openalex-snapshot
Formal verification of reconfigurable cores
inferred← citeshttps://doi.org/10.25911/5d7a2ba742b8copenalex-snapshot
Investigations into Satisfiability Search
inferred← citeshttps://doi.org/10.48456/tr-601openalex-snapshot
Combining model checking and theorem proving
inferred← citeshttps://doi.org/10.5555/789083.1022835openalex-snapshot
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications
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.