On the public citation graph
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal
0 signed · 50 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/3-540-45657-0_40openalex-snapshot
CVC: A Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/3-540-45657-0_7openalex-snapshot
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
inferredcites →https://doi.org/10.1007/3-540-45988-x_11openalex-snapshot
A Generalization of Shostak#x2019;s Method for Combining Decision Procedures
inferredcites →https://doi.org/10.1007/978-3-540-25984-8_14openalex-snapshot
The ICS Decision Procedures for Embedded Deduction
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_14openalex-snapshot
DPLL(T): Fast Decision Procedures
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_49openalex-snapshot
CVC Lite: A New Implementation of the Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/978-3-540-30482-1_32openalex-snapshot
Verifying a File System Implementation
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/lics.2001.932480openalex-snapshot
A decision procedure for an extensional theory of arrays
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/11560647_39openalex-snapshot
On Superposition-Based Satisfiability Procedures and Their Combination
inferred← citeshttps://doi.org/10.1007/11691617_9openalex-snapshot
Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11814771_42openalex-snapshot
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
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-030-22102-7_3openalex-snapshot
Theory Combination: Beyond Equality Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_13openalex-snapshot
Efficient E-Matching for SMT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_14openalex-snapshot
${\mathcal{T}}$ -Decision by Decomposition
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_14openalex-snapshot
Noetherianity and Combination Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_3openalex-snapshot
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_30openalex-snapshot
Building Extended Canonizers by Graph-Based Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_16openalex-snapshot
On Combinations of Local Theory Extensions
inferred← citeshttps://doi.org/10.1007/s10009-008-0091-0openalex-snapshot
Bounded model checking of software using SMT solvers instead of SAT solvers
inferred← citeshttps://doi.org/10.1007/s10009-009-0105-6openalex-snapshot
Satisfiability solving for software verification
inferred← citeshttps://doi.org/10.1007/s10472-007-9078-xopenalex-snapshot
Decision procedures for extensions of the theory of arrays
inferred← citeshttps://doi.org/10.1007/s10817-010-9213-yopenalex-snapshot
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.039openalex-snapshot
Rewrite-Based Satisfiability Procedures for Recursive Data Structures
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.042openalex-snapshot
Rewrite-Based Decision Procedures
inferred← citeshttps://doi.org/10.1016/j.ic.2005.10.002openalex-snapshot
Modular proof systems for partial functions with Evans equality
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.005openalex-snapshot
Automatic decidability and combinability
inferred← citeshttps://doi.org/10.1016/j.scico.2014.02.005openalex-snapshot
A rule-based system for automatic decidability and combinability
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.22028/d291-26011openalex-snapshot
Reasoning in combinations of theories
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.70675/7ae010e1z9e59z4818z9c3ezab1b32bbb853openalex-snapshot
Schematic calculi for the analysis of decision procedures
showing the first 29 of 30 · page through all 30
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.