On the public citation graph
On Superposition-Based Satisfiability Procedures and Their Combination
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.1007/11559306_3openalex-snapshot
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic
inferredcites →https://doi.org/10.1007/11559306_4openalex-snapshot
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal
inferredcites →https://doi.org/10.1007/978-3-540-25984-8_12openalex-snapshot
Using Automated Theorem Provers to Certify Auto-generated Aerospace Software
inferredcites →https://doi.org/10.1007/978-3-540-31862-0_27openalex-snapshot
Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn
inferredcites →https://doi.org/10.1007/978-3-540-45085-6_15openalex-snapshot
Superposition Modulo a Shostak Theory
inferredcites →https://doi.org/10.1007/978-3-540-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferredcites →https://doi.org/10.1007/b107116openalex-snapshot
An automatic mapping from Statecharts to Verilog
inferredcites →https://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferredcites →https://doi.org/10.1016/s0890-5401(03)00020-8openalex-snapshot
A rewriting approach to satisfiability procedures
inferredcites →https://doi.org/10.1109/sefm.2003.1236224openalex-snapshot
Light-weight theorem proving for debugging and verifying units of code
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision 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/11853886_16openalex-snapshot
Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies
inferred← citeshttps://doi.org/10.1007/11916277_37openalex-snapshot
Automatic Combinability of Rewriting-Based Satisfiability Procedures
inferred← citeshttps://doi.org/10.1007/11921240_26openalex-snapshot
Decision Procedures for the Formal Analysis of Software
inferred← citeshttps://doi.org/10.1007/978-3-319-29510-7_1openalex-snapshot
Variant-Based Satisfiability in Initial Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_14openalex-snapshot
Noetherianity and Combination Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_35openalex-snapshot
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_20openalex-snapshot
Data Structures with Arithmetic Constraints: A Non-disjoint Combination
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_4openalex-snapshot
Superposition for Bounded Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_14openalex-snapshot
Obtaining Finite Local Theory Axiomatizations via Saturation
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_2openalex-snapshot
Symbolic Reasoning Methods in Rewriting Logic and Maude
inferred← citeshttps://doi.org/10.1007/s10009-009-0105-6openalex-snapshot
Satisfiability solving for software verification
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.005openalex-snapshot
Automatic decidability and combinability
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.10.006openalex-snapshot
Combination of convex theories: Modularity, deduction completeness, and explanation
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.001openalex-snapshot
Variant-based satisfiability in initial algebras
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.3233/fi-2010-362openalex-snapshot
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
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.