On the public citation graph
Fast and Flexible Difference Constraint Propagation for DPLL(T)
0 signed · 78 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/11513988_33openalex-snapshot
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic
inferredcites →https://doi.org/10.1007/3-540-45678-3_43openalex-snapshot
Shortest Path Algorithms: Engineering Aspects
inferredcites →https://doi.org/10.1007/3-540-45739-9_15openalex-snapshot
Verification of Timed Automata via Satisfiability Checking
inferredcites →https://doi.org/10.1007/3-540-61680-2_67openalex-snapshot
Negative-cycle detection algorithms
inferredcites →https://doi.org/10.1007/3-540-68530-8_27openalex-snapshot
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
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-32275-7_3openalex-snapshot
Abstract DPLL and Abstract DPLL Modulo Theories
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s101070050058openalex-snapshot
Negative-cycle detection algorithms
inferredcites →https://doi.org/10.1016/j.dam.2006.10.007openalex-snapshot
BerkMin: A fast and robust Sat-solver
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
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-04618-7_10openalex-snapshot
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints
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-43619-2_17openalex-snapshot
Hybrid ASP-Based Multi-objective Scheduling of Semiconductor Manufacturing Processes
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-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_29openalex-snapshot
Model Checking Real-Time Systems
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-18008-3_28openalex-snapshot
Learning General Constraints in CSP
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-44953-1_28openalex-snapshot
Explaining Producer/Consumer Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-61033-7_6openalex-snapshot
A Tutorial on Hybrid Answer Set Solving with clingo
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-70545-1_28openalex-snapshot
The MathSAT 4 SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_2openalex-snapshot
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_17openalex-snapshot
Encodings of the Sequence Constraint
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-85958-1_11openalex-snapshot
Flow-Based Propagators for the SEQUENCE and Related Global Constraints
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-24364-6_12openalex-snapshot
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_8openalex-snapshot
The Conjunction of Interval Among Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_38openalex-snapshot
Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
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-33558-7_20openalex-snapshot
Solving Temporal Problems Using SMT: Strong Controllability
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_10openalex-snapshot
Exploiting Sparsity in Difference-Bound Matrices
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/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/s10601-014-9167-5openalex-snapshot
Solving strong controllability of temporal problems with uncertainty using SMT
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.1016/j.artint.2016.06.002openalex-snapshot
Learning general constraints in CSP
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106339openalex-snapshot
Set covering heuristics in a Benders decomposition for railway timetabling
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.011openalex-snapshot
Randomized algorithms for finding the shortest negative cost cycle in networks
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.055openalex-snapshot
Empirical analysis of algorithms for the shortest negative cost cycle problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.02.043openalex-snapshot
A logic-based Benders decomposition for microscopic railway timetable planning
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.002openalex-snapshot
Cyclic-routing of Unmanned Aerial Vehicles
inferred← citeshttps://doi.org/10.1016/j.scico.2010.08.002openalex-snapshot
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks
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.1016/j.tcs.2021.05.007openalex-snapshot
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
inferred← citeshttps://doi.org/10.1017/s1471068410000293openalex-snapshot
FO(FD): Extending classical logic with rule-based fixpoint definitions
inferred← citeshttps://doi.org/10.1017/s1471068417000242openalex-snapshot
Clingo goes linear constraints over reals and integers
inferred← citeshttps://doi.org/10.1017/s1471068421000508openalex-snapshot
How to Build Your Own ASP-based System?!
inferred← citeshttps://doi.org/10.1017/s1471068422000217openalex-snapshot
Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
inferred← citeshttps://doi.org/10.1109/gcce.2018.8574651openalex-snapshot
Interpolation Based Unbounded Model Checking for Time Petri Nets
inferred← citeshttps://doi.org/10.1109/ictai66417.2025.00040openalex-snapshot
A Framework for Hybrid Set-Theoretic and Numerical Problem Solving
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/1389449.1389478openalex-snapshot
Global difference constraint propagation for finite domain solvers
inferred← citeshttps://doi.org/10.1145/1592434.1592437openalex-snapshot
Automated deduction for verification
inferred← citeshttps://doi.org/10.1145/1838552.1838559openalex-snapshot
Efficient generation of craig interpolants in satisfiability modulo theories
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0369openalex-snapshot
Incremental Satisfiability and Implication for UTVPI Constraints
inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot
An Effective SMT Engine for Formal Verification
inferred← citeshttps://doi.org/10.1587/transinf.2019edl8086openalex-snapshot
Symbolic Representation of Time Petri Nets for Efficient Bounded Model Checking
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/faia230520openalex-snapshot
Unit Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.3233/sat190031openalex-snapshot
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in Solving Difference Logic
inferred← citeshttps://doi.org/10.48550/arxiv.0811.0987openalex-snapshot
Modular difference logic is hard
inferred← citeshttps://doi.org/10.48550/arxiv.2010.07082openalex-snapshot
Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version)
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.