Improving IntSat by expressing disjunctions of bounds as linear constraints

DOI10.3233/AIC-150684zbMath1373.68370OpenAlexW1901058435MaRDI QIDQ4589125

Marc Bezem, Roberto Asín, Robert Nieuwenhuis

Publication date: 7 November 2017

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-150684

zbMATH Keywords

integer linear programmingconstraint programmingSATconflict-driven clause learning

Mathematics Subject Classification ID

Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Improving IntSat by expressing disjunctions of bounds as linear constraints