Evaluating logic gate constraints in local search for structured satisfiability problems
File version
Accepted Manuscript (AM)
Author(s)
Polash, MMA
Pham, DN
Thornton, J
Su, K
Sattar, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
Conjunctive normal forms (CNF) of structured satisfiability problems contain logic gate patterns. So Boolean circuits (BC) by and large can be obtained from them and thus structural information that is lost in the CNF can be recovered. However, it is not known which logic gates are useful for local search on BCs or which logic gates in particular help local search the most and why. In this article, we empirically show that exploitation of xor, xnor, eq, and not gates is a key factor behind the performance of local search algorithms using single variable flips when adapted to logic gate constraints. Moreover, controlled experiments and investigations into the variables selected for flipping further elucidates these findings. To achieve these conclusions, we have adapted the AdaptNovelty+ and CCANr algorithms to cope with logic gate-based constraint models. These are two prominent families of local search algorithms for satisfiability. We performed our experiments using a large set of benchmark instances from SATLib, SAT2014, and SAT2020. We have also presented techniques to eliminate cycles among logic gates that are detected from CNF and to propagate equivalence of variables statically through the logic gate dependency relationships.
Journal Title
Artificial Intelligence Review
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2021 American Aging Association. This is an electronic version of an article published in Artificial Intelligence Review, 2021. Artificial Intelligence Review is available online at: http://link.springer.com/ with the open URL of your article.
Item Access Status
Note
This publication has been entered in Griffith Research Online as an advanced online version.
Access the data
Related item(s)
Subject
Artificial intelligence
Cognitive and computational psychology
Information and computing sciences
Psychology
Science & Technology
Computer Science
Satisfiability
Persistent link to this record
Citation
Newton, MAH; Polash, MMA; Pham, DN; Thornton, J; Su, K; Sattar, A, Evaluating logic gate constraints in local search for structured satisfiability problems, Artificial Intelligence Review, 2021