License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2021.7
URN: urn:nbn:de:0030-drops-152982
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15298/
Kheireddine, Anissa ;
Renault, Etienne ;
Baarir, Souheib
Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)
Abstract
This paper presents a new way to improve the performance of the SAT-based bounded model checking problem by exploiting relevant information identified through the characteristics of the original problem. This led us to design a new way of building interesting heuristics based on the structure of the underlying problem. The proposed methodology is generic and can be applied for any SAT problem. This paper compares the state-of-the-art approach with two new heuristics: Structure-based and Linear Programming heuristics and show promising results.
BibTeX - Entry
@InProceedings{kheireddine_et_al:LIPIcs.CP.2021.7,
author = {Kheireddine, Anissa and Renault, Etienne and Baarir, Souheib},
title = {{Towards Better Heuristics for Solving Bounded Model Checking Problems}},
booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
pages = {7:1--7:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-211-2},
ISSN = {1868-8969},
year = {2021},
volume = {210},
editor = {Michel, Laurent D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15298},
URN = {urn:nbn:de:0030-drops-152982},
doi = {10.4230/LIPIcs.CP.2021.7},
annote = {Keywords: Bounded model checking, SAT, Structural information, Linear Programming}
}
