On the public citation graph

To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$

0 signed · 30 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/11513988_34openalex-snapshot
Efficient Satisfiability Modulo Theories via Delayed Theory Combination
inferredcites →https://doi.org/10.1007/11513988_4openalex-snapshot
SMT-COMP: Satisfiability Modulo Theories Competition
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/11916277_36openalex-snapshot
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis
inferredcites →https://doi.org/10.1007/3-540-44585-4_22openalex-snapshot
ICS: Integrated Canonizer and Solver?
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/3-540-45657-0_2openalex-snapshot
The Quest for Efficient Boolean Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
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-30206-3_19openalex-snapshot
Some Progress in Satisfiability Checking for Difference Logic
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_21openalex-snapshot
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
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/j.ic.2005.05.011openalex-snapshot
Efficient theory combination via boolean search
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
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
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.

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-319-66263-3_20openalex-snapshot
A Resolution-Style Proof System for DQBF
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_28openalex-snapshot
The MathSAT 4 SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_9openalex-snapshot
Development and Evaluation of LAV: An SMT-Based Error Finding Platform
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_2openalex-snapshot
The Strategy Challenge in SMT Solving
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_20openalex-snapshot
Encodings of Bounded Synthesis
inferred← citeshttps://doi.org/10.1007/s00165-018-0475-1openalex-snapshot
Formal reliability analysis of redundancy architectures
inferred← citeshttps://doi.org/10.1007/s10601-012-9123-1openalex-snapshot
Solving constraint satisfaction problems with SAT modulo theories
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.079openalex-snapshot
Model-based Theory Combination
inferred← citeshttps://doi.org/10.1145/3428245openalex-snapshot
Dataflow-based pruning for speeding up superoptimization
inferred← citeshttps://doi.org/10.1145/3442381.3450002openalex-snapshot
On the Feasibility of Automated Built-in Function Modeling for PHP Symbolic Execution
inferred← citeshttps://doi.org/10.23919/date54114.2022.9774672openalex-snapshot
BMC+Fuzz: Efficient and Effective Test Generation
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.