On the public citation graph
Automatic Combinability of Rewriting-Based Satisfiability Procedures
0 signed · 23 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_4openalex-snapshot
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal
inferredcites →https://doi.org/10.1007/11560647_39openalex-snapshot
On Superposition-Based Satisfiability Procedures and Their Combination
inferredcites →https://doi.org/10.1007/11814771_42openalex-snapshot
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
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.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
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/978-3-030-22102-7_3openalex-snapshot
Theory Combination: Beyond Equality Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-73147-4openalex-snapshot
Rewriting, Computation and Proof
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_22openalex-snapshot
Automatic Decidability and Combinability Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_16openalex-snapshot
Combining Proof-Producing Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_15openalex-snapshot
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic
inferred← citeshttps://doi.org/10.1007/s10817-010-9200-3openalex-snapshot
An Instantiation Scheme for Satisfiability Modulo Theories
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.jsc.2008.10.008openalex-snapshot
Theory decision by decomposition
inferred← citeshttps://doi.org/10.1093/logcom/exm055openalex-snapshot
On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
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.