Affiliation:
1. Department of Computer Science, Roosevelt University, IL, USA
Abstract
We define a distance function on propositional formulas in CNF as a measure of non-isomorphism of formulas: the larger the distance between two formulas is, the further they are from being isomorphic. This distance induces a metric on isomorphism classes of formulas. We show how this distance can be used for SAT solving, namely for per-instance algorithm selection where there is a “portfolio” of SAT solvers and there is a “meta-solver” that chooses a solver from the portfolio for a given input formula.
Reference17 articles.
1. Approximation algorithms for treewidth;Amir;Algorithmica,2010
2. Structure features for SAT instances classification;Ansótegui;Journal of Applied Logic,2017
3. G. Ausiello, F. Cristiano, P. Fantozzi and L. Laura, Syntactic isomorphism of CNF Boolean formulas is graph isomorphism complete, in: Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020, CEUR Workshop Proceedings, Vol. 2756, CEUR-WS.org, 2020, pp. 190–201.
4. L. Babai, Graph isomorphism in quasipolynomial time [extended abstract], in: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, ACM, 2016, pp. 684–697.
5. D. Burago, Y. Burago and S. Ivanov, A Course in Metric Geometry, Graduate Studies in Mathematics, Vol. 33, American Mathematical Society, 2001.