On the public citation graph
On Solving Boolean Combinations of UTVPI Constraints
0 signed · 47 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.1002/malq.200310099openalex-snapshot
On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
inferredcites →https://doi.org/10.1007/11499107_18openalex-snapshot
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
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/11559306_9openalex-snapshot
An Efficient Decision Procedure for UTVPI Constraints
inferredcites →https://doi.org/10.1007/11591191_3openalex-snapshot
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
inferredcites →https://doi.org/10.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferredcites →https://doi.org/10.1007/3-540-36577-x_38openalex-snapshot
An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic
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/978-1-4020-5571-3_12openalex-snapshot
MathSAT: Tight Integration of SAT and Mathematical 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_36openalex-snapshot
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-642-95322-4_17openalex-snapshot
On the Computational Complexity of Integer Programming Problems
inferredcites →https://doi.org/10.1007/bf01585160openalex-snapshot
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
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.1007/s10990-006-8609-1openalex-snapshot
The octagon abstract domain
inferredcites →https://doi.org/10.1016/0097-3165(73)90004-6openalex-snapshot
Fourier-Motzkin elimination and its dual
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1090/s0002-9939-1976-0396605-3openalex-snapshot
Bounds on Positive Integral Solutions of Linear Diophantine Equations
inferredcites →https://doi.org/10.1090/s0002-9939-1978-0500555-0openalex-snapshot
A Bound on Solutions of Linear Integer Equalities and Inequalities
inferredcites →https://doi.org/10.1109/fmcad.2006.7openalex-snapshot
Ario: A Linear Integer Arithmetic Logic Solver
inferredcites →https://doi.org/10.1109/lics.2004.1319604openalex-snapshot
Deciding quantifier-free Presburger formulas using parameterized solution bounds
inferredcites →https://doi.org/10.1137/s0097539793251876openalex-snapshot
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/322276.322287openalex-snapshot
On the complexity of integer programming
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
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-10085-2_27openalex-snapshot
Translatable Updates of Selection Views under Constant Complement
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_25openalex-snapshot
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-21311-3_21openalex-snapshot
A New Algorithm for Linear and Integer Feasibility in Horn Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_8openalex-snapshot
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
inferred← citeshttps://doi.org/10.1007/978-3-642-39467-6_10openalex-snapshot
Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes
inferred← citeshttps://doi.org/10.1007/s00453-022-01017-8openalex-snapshot
General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs
inferred← citeshttps://doi.org/10.1007/s10817-009-9139-4openalex-snapshot
Optimal Length Resolution Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.001openalex-snapshot
A combinatorial algorithm for Horn programs
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103780openalex-snapshot
Algorithms and complexity of difference logic
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.1109/tkde.2014.2334327openalex-snapshot
Lossless Selection Views under Conditional Domain Constraints
inferred← citeshttps://doi.org/10.1145/2429069.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
inferred← citeshttps://doi.org/10.1145/2480359.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
inferred← citeshttps://doi.org/10.1155/2009/845804openalex-snapshot
On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0369openalex-snapshot
Incremental Satisfiability and Implication for UTVPI Constraints
inferred← citeshttps://doi.org/10.24963/ijcai.2020/247openalex-snapshot
Lower Bounds and Faster Algorithms for Equality Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3016openalex-snapshot
The View Update Problem Revisited
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.