On the public citation graph
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
0 signed · 141 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/10720246_8openalex-snapshot
SAT-Based Procedures for Temporal Reasoning
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/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_16openalex-snapshot
Deciding Separation Formulas with SAT
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-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-48683-6_39openalex-snapshot
Deciding Equality Formulas by Small Domains Instantiations
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_12openalex-snapshot
Range Allocation for Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_13openalex-snapshot
An Experimental Evaluation of Ground Decision Procedures
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_40openalex-snapshot
The UCLID Decision Procedure
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/978-3-540-32275-7_3openalex-snapshot
Abstract DPLL and Abstract DPLL Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-540-39813-4_5openalex-snapshot
Congruence Closure with Integer Offsets
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-snapshot
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/566385.566390openalex-snapshot
Boolean satisfiability with transitivity constraints
inferredcites →https://doi.org/10.1145/775832.775945openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferredcites →https://doi.org/10.1609/aimag.v20i2.1459openalex-snapshot
Recent Advances in AI Planning
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11591191_23openalex-snapshot
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
inferred← citeshttps://doi.org/10.1007/11591191_3openalex-snapshot
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
inferred← citeshttps://doi.org/10.1007/11691372_9openalex-snapshot
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver
inferred← citeshttps://doi.org/10.1007/11757283_6openalex-snapshot
Building Efficient Decision Procedures on Top of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11814948_1openalex-snapshot
From Propositional Satisfiability to Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/11814948_17openalex-snapshot
Lemma Learning in SMT on Linear Constraints
inferred← citeshttps://doi.org/10.1007/11814948_18openalex-snapshot
On SAT Modulo Theories and Optimization Problems
inferred← citeshttps://doi.org/10.1007/11814948_19openalex-snapshot
Fast and Flexible Difference Constraint Propagation for DPLL(T)
inferred← citeshttps://doi.org/10.1007/11814948_20openalex-snapshot
A Progressive Simplifier for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferred← citeshttps://doi.org/10.1007/11817963_39openalex-snapshot
SMT Techniques for Fast Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/11817963_42openalex-snapshot
The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_6openalex-snapshot
Bounded Model Checking for Concurrent Systems: Synchronous Vs. Asynchronous
inferred← citeshttps://doi.org/10.1007/978-3-030-03044-5_14openalex-snapshot
Timed Scenarios: Consistency, Equivalence and Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-46714-2_6openalex-snapshot
Allen’s Interval Algebra Makes the Difference
inferred← citeshttps://doi.org/10.1007/978-3-030-75775-5_11openalex-snapshot
Analyzing Unit Read-Once Refutations in Difference Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_12openalex-snapshot
Local Search for SMT on Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_16openalex-snapshot
Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination
inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_31openalex-snapshot
Satisfiability Modulo Theories: A Beginner’s Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-031-97492-2_1openalex-snapshot
Retrieving Unknown SMT Formulas via Structural Mutations
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_10openalex-snapshot
Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_10openalex-snapshot
SAT Modulo Graphs: Acyclicity
inferred← citeshttps://doi.org/10.1007/978-3-319-29778-1_18openalex-snapshot
SMT Solving for the Theory of Ordering Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_11openalex-snapshot
Colors Make Theories Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_39openalex-snapshot
Analyzing Lattice Point Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_27openalex-snapshot
The Barcelogic SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_2openalex-snapshot
Challenges in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_30openalex-snapshot
Efficient Interpolant Generation in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_8openalex-snapshot
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_11openalex-snapshot
Efficient Decision Procedure for Bounded Integer Non-linear Operations Using SMT( $\mathcal{LIA}$ )
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_20openalex-snapshot
Efficient Term-ITE Conversion for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_12openalex-snapshot
veriT: An Open, Trustable and Efficient SMT-Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_15openalex-snapshot
Interpolant Generation for UTVPI
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_14openalex-snapshot
Computing Stable Models via Reductions to Difference Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_13openalex-snapshot
Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing
inferred← citeshttps://doi.org/10.1007/978-3-642-11811-1_17openalex-snapshot
Automatic Verification for a Class of Proof Obligations with SMT-Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-13480-7_35openalex-snapshot
Core Non-emptiness Checking in Hedonic Games via Difference Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-25566-3_25openalex-snapshot
Active Learning of Combinatorial Features for Interactive Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-33365-1_13openalex-snapshot
SMT-Based Induction Methods for Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_27openalex-snapshot
An Abstract Interpretation of DPLL(T)
inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_6openalex-snapshot
Translating Answer-Set Programs into Bit-Vector Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_2openalex-snapshot
Decision Procedures for Flat Array Properties
inferred← citeshttps://doi.org/10.1007/s00165-009-0105-zopenalex-snapshot
A framework for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/s00224-023-10134-yopenalex-snapshot
Unit Read-once Refutations for Systems of Difference Constraints
inferred← citeshttps://doi.org/10.1007/s00453-016-0131-1openalex-snapshot
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/s10462-016-9495-5openalex-snapshot
Parallelizing simplex within SMT solvers
inferred← citeshttps://doi.org/10.1007/s10472-009-9118-9openalex-snapshot
Stable models and difference logic
inferred← citeshttps://doi.org/10.1007/s10472-009-9152-7openalex-snapshot
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
inferred← citeshttps://doi.org/10.1007/s10703-017-0314-7openalex-snapshot
Incrementally closing octagons
inferred← citeshttps://doi.org/10.1007/s10817-006-9026-1openalex-snapshot
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)
inferred← citeshttps://doi.org/10.1007/s10817-006-9033-2openalex-snapshot
Answer Set Programming Based on Propositional Satisfiability
inferred← citeshttps://doi.org/10.1007/s10817-015-9323-7openalex-snapshot
Decision Procedures for Flat Array Properties
inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot
Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1007/s10878-017-0176-3openalex-snapshot
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106777openalex-snapshot
SMT encodings for Resource-Constrained Project Scheduling Problems
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.03.004openalex-snapshot
Satisfiability modulo theories for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.004openalex-snapshot
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.077openalex-snapshot
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.048openalex-snapshot
Combining Decision Procedures by (Model-)Equality Propagation
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.004openalex-snapshot
Solving parity games by a reduction to SAT
inferred← citeshttps://doi.org/10.1016/j.scico.2010.04.003openalex-snapshot
Combining decision procedures by (model-)equality propagation
inferred← citeshttps://doi.org/10.1016/j.scico.2011.03.007openalex-snapshot
Integration of SMT-solvers in B and Event-B development environments
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.013openalex-snapshot
Theory propagation and reification
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.016openalex-snapshot
Feasibility checking in Horn constraint systems through a reduction based approach
inferred← citeshttps://doi.org/10.1017/s1471068410000293openalex-snapshot
FO(FD): Extending classical logic with rule-based fixpoint definitions
inferred← citeshttps://doi.org/10.1017/s1471068412000105openalex-snapshot
The third open answer set programming competition
inferred← citeshttps://doi.org/10.1017/s1471068417000114openalex-snapshot
On relation between constraint answer set programming and satisfiability modulo theories
inferred← citeshttps://doi.org/10.1017/s147106841800056xopenalex-snapshot
Inlining External Sources in Answer Set Programs
inferred← citeshttps://doi.org/10.1017/s1471068421000478openalex-snapshot
Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
inferred← citeshttps://doi.org/10.1093/logcom/exv063openalex-snapshot
Declarative encodings of acyclicity properties
inferred← citeshttps://doi.org/10.1109/dac.2006.229207openalex-snapshot
Predicate learning and selective theory deduction for a difference logic solver
inferred← citeshttps://doi.org/10.1109/fmcad.2006.13openalex-snapshot
Finite Instantiations for Integer Difference Logic
inferred← citeshttps://doi.org/10.1109/fmcad.2006.7openalex-snapshot
Ario: A Linear Integer Arithmetic Logic Solver
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.18openalex-snapshot
A Write-Based Solver for SAT Modulo the Theory of Arrays
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.32openalex-snapshot
Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351140openalex-snapshot
Efficient decision procedure for non-linear arithmetic constraints using CORDIC
inferred← citeshttps://doi.org/10.1109/iccad.2006.320088openalex-snapshot
SMT(CLU): A Step toward Scalability in System Verification
inferred← citeshttps://doi.org/10.1109/memcod.2010.5558625openalex-snapshot
A flexible schema for generating explanations in lazy theory propagation
inferred← citeshttps://doi.org/10.1109/wodes.2008.4605924openalex-snapshot
Beyond Boolean SAT: Satisfiability modulo theories
inferred← citeshttps://doi.org/10.1145/1146909.1146971openalex-snapshot
Predicate learning and selective theory deduction for a difference logic solver
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferred← citeshttps://doi.org/10.1145/1233501.1233664openalex-snapshot
Accelerating high-level bounded model checking
inferred← citeshttps://doi.org/10.1145/1403375.1403578openalex-snapshot
Completeness in SMT-based BMC for software programs
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.1145/1838552.1838559openalex-snapshot
Efficient generation of craig interpolants in satisfiability modulo theories
inferred← citeshttps://doi.org/10.1145/1878961.1878986openalex-snapshot
Improving platform-based system synthesis by satisfiability modulo theories solving
inferred← citeshttps://doi.org/10.1145/2480759.2480767openalex-snapshot
Tableau Calculi for Logic Programs under Answer Set Semantics
inferred← citeshttps://doi.org/10.1145/2505879.2505901openalex-snapshot
Theory propagation and rational-trees
inferred← citeshttps://doi.org/10.1145/3131851.3131861openalex-snapshot
Theory learning with symmetry breaking
inferred← citeshttps://doi.org/10.15168/11572_368048openalex-snapshot
A Reactive Search Optimization approach to interactive decision making
inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot
An Effective SMT Engine for Formal Verification
inferred← citeshttps://doi.org/10.1613/jair.1.11221openalex-snapshot
Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access
inferred← citeshttps://doi.org/10.1631/jzus.a0820812openalex-snapshot
Equality detection for linear arithmetic constraints
inferred← citeshttps://doi.org/10.17760/d20194113openalex-snapshot
Mathematical programming modulo theories
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-351openalex-snapshot
Answer Set Programming as SAT modulo Acyclicity
inferred← citeshttps://doi.org/10.3233/faia230278openalex-snapshot
Enhancing Hybrid CP-SAT Search for Disjunctive Scheduling
inferred← citeshttps://doi.org/10.3233/sat190011openalex-snapshot
Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.3233/sat190029openalex-snapshot
Disequality Management in Integer Difference Logic via Finite Instantiations1
inferred← citeshttps://doi.org/10.3233/sat190030openalex-snapshot
On Solving Boolean Combinations of UTVPI Constraints
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.33915/etd.3843openalex-snapshot
Analyzing Satisfiability and Refutability in Selected Constraint Systems
inferred← citeshttps://doi.org/10.33915/etd.430openalex-snapshot
Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.469openalex-snapshot
Answer Set Programming with External Sources
inferred← citeshttps://doi.org/10.48550/arxiv.1204.5639openalex-snapshot
SMT-based Induction Methods for Timed Systems
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
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.