On the public citation graph

On Variable-inactivity and Polynomial Formula-Satisfiability Procedures

0 signed · 49 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/11527695_2openalex-snapshot
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
inferredcites →https://doi.org/10.1007/11559306_1openalex-snapshot
A Comprehensive Framework for Combined Decision Procedures
inferredcites →https://doi.org/10.1007/11559306_9openalex-snapshot
An Efficient Decision Procedure for UTVPI Constraints
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.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferredcites →https://doi.org/10.1007/11916277_37openalex-snapshot
Automatic Combinability of Rewriting-Based Satisfiability Procedures
inferredcites →https://doi.org/10.1007/3-540-45620-1_35openalex-snapshot
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
inferredcites →https://doi.org/10.1007/3-540-45657-0_18openalex-snapshot
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
inferredcites →https://doi.org/10.1007/3-540-45744-5_44openalex-snapshot
A New Meta-Complexity Theorem for Bottom-Up Logic Programs
inferredcites →https://doi.org/10.1007/3-540-48257-1_24openalex-snapshot
PVS: An Experience Report
inferredcites →https://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot
Automated Model Building
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-73595-3_14openalex-snapshot
${\mathcal{T}}$ -Decision by Decomposition
inferredcites →https://doi.org/10.1007/978-3-540-73595-3_22openalex-snapshot
Automatic Decidability and Combinability Revisited
inferredcites →https://doi.org/10.1007/s10817-005-9004-zopenalex-snapshot
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
inferredcites →https://doi.org/10.1016/b978-044450813-3/50009-6openalex-snapshot
Paramodulation-Based Theorem Proving
inferredcites →https://doi.org/10.1016/j.entcs.2006.11.039openalex-snapshot
Rewrite-Based Satisfiability Procedures for Recursive Data Structures
inferredcites →https://doi.org/10.1016/j.entcs.2006.11.042openalex-snapshot
Rewrite-Based Decision Procedures
inferredcites →https://doi.org/10.1016/j.ic.2006.08.009openalex-snapshot
Fast congruence closure and extensions
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.1998.705646openalex-snapshot
Efficient representation and validation of proofs
inferredcites →https://doi.org/10.1109/lics.2002.1029813openalex-snapshot
Automatic decidability
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/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferredcites →https://doi.org/10.1145/322203.322204openalex-snapshot
Reasoning About Recursively Defined Data Structures
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-319-29510-7_1openalex-snapshot
Variant-Based Satisfiability in Initial Algebras
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-642-00768-2_35openalex-snapshot
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_3openalex-snapshot
On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
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-14128-7_6openalex-snapshot
Instantiation of SMT Problems Modulo Integers
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/978-3-642-31365-3_17openalex-snapshot
A Calculus for Generating Ground Explanations
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_3openalex-snapshot
Canonical Ground Horn Theories
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/s10817-010-9200-3openalex-snapshot
An Instantiation Scheme for Satisfiability Modulo Theories
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.1007/s10817-014-9314-0openalex-snapshot
On Interpolation in Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/s10817-015-9325-5openalex-snapshot
Interpolation Systems for Ground Proofs in Automated Deduction: a Survey
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.10.008openalex-snapshot
Theory decision by decomposition
inferred← citeshttps://doi.org/10.1016/j.scico.2017.09.001openalex-snapshot
Variant-based satisfiability in initial algebras
inferred← citeshttps://doi.org/10.1145/1836089.1836090openalex-snapshot
On theorem proving for program checking
inferred← citeshttps://doi.org/10.22028/d291-26547openalex-snapshot
Superposition modulo theory
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.48550/arxiv.1201.5954openalex-snapshot
A Calculus for Generating Ground Explanations (Technical Report)
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.