A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems

DOI10.1007/11493853_24MaRDI QIDQ5450941zbMATH OpenOpenAlexFDO

Authors Hossein M. Sheini, Karem A. Sakallah

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_24

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Theory and Applications of Satisfiability Testing
• On solving Boolean combinations of UTVPI constraints.
• Frontiers of Combining Systems
• Incremental satisfiability and implication for UTVPI constraints
• scientific article; zbMATH DE number 2090300

Cited in

(5)

• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
• Theory and Applications of Satisfiability Testing
• Mixed logical-linear programming
• Integration of an LP solver into interval constraint propagation
• A conditional logic approach for strengthening mixed 0-1 linear programs

Describes a project that uses

Uses Software

• Chaff
• MiniSat

This page was built for publication: A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450941)