Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
ACM Transactions on Computational Logic (TOCL)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Introduction to algorithms
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On Solving Presburger and Linear Arithmetic with SAT
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Verification of Timed Automata via Satisfiability Checking
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
Proceedings of the 40th annual Design Automation Conference
Model-checking processes with data
Science of Computer Programming
Predicate learning and selective theory deduction for a difference logic solver
Proceedings of the 43rd annual Design Automation Conference
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Intelligent Systems and Formal Methods in Software Engineering
IEEE Intelligent Systems
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Predicate abstraction with indexed predicates
ACM Transactions on Computational Logic (TOCL)
Chain programming over difference constraints
Nordic Journal of Computing
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Generalizing DPLL to Richer Logics
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Term Rewriting Technique for Decision Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Artificial Intelligence Research
TSAT++: an Open Platform for Satisfiability Modulo Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining instance generation and resolution
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Computing small unsatisfiable cores in satisfiability modulo theories
Journal of Artificial Intelligence Research
Exploiting symmetry in SMT problems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Deciding separation logic formulae by SAT and incremental negative cycle elimination
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A SAT-based decision procedure for the boolean combination of difference constraints
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Analyzing chain programs over difference constraints
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Checking bounded reachability in asynchronous systems by symbolic event tracing
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
A scalable method for solving satisfiability of integer linear arithmetic logic
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
The heuristic theorem prover: yet another SMT modulo theorem prover
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Predicate abstraction via symbolic decision procedures
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Efficient satisfiability modulo theories via delayed theory combination
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
SDSAT: tight integration of small domain encoding and lazy approaches in a separation logic solver
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Solving disjunctive temporal problems with preferences using maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Solving difference constraints over modular arithmetic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
SMELS: Satisfiability Modulo Equality with Lazy Superposition
Journal of Automated Reasoning
| Hi-index | 0.00 |
We show a reduction to propositional logic from a Boolean combination of inequalities of the form vi 驴 vj + c and vi vj + c, where c is a constant and vi, vj are variables of type real or integer. Equalities and uninterpreted functions can be expressed in this logic as well. We discuss the advantages of using this reduction as compared to competing methods, and present experimental results that support our claims.