Grid based clustering for satisfiability solving

doi:10.1016/j.asoc.2020.106069

Grid based clustering for satisfiability solving

2020-03-01

18

PRE

AI

DOI：10.1016/j.asoc.2020.106069

Original

Original request for help

Save

Abstract

En 中文

The originality of this work resides into the exploitation of data mining techniques for problem solving. Two major phases define this work. The first one is to determine the clustering technique that best suits each SAT instance based on the distribution of the later. The clustering technique is then applied to reduce the complexity of each instance by creating sub-instances that can be solved independently in the second phase. The latter consists into a resolution step where the DPLL or BSO algorithms are executed depending on the number of variables to be assigned in each cluster. This two-phase resolution strategy provides more efficient problem solving. The Boolean Satisfiability problem (SAT) is considered in this study because of its importance for the Artificial Intelligence (AI) community and the impact of its solving on other complex problems. Three different distributions of the problem were observed. The first distribution defines a space where the variables are dispersed forming regions of considerable density interspersed with regions of lower density or empty regions. On the other hand, the other two distributions do not show any significant shape, as the variables are randomly scattered, with one of these two dispersions having the particularity that almost all its variables are of high occurrence. To each of the three distributions, a clustering technique is associated. Density-based clustering techniques are the most appropriate type of clustering for the first distribution. Meanwhile, grid-based clustering and frequent patterns mining seem to be the most suitable clustering techniques for the second and third distributions. Investigations are undertaken on these latter issues and contributions are presented in this paper. Experiments were conducted on public benchmarks and the results showed the importance of the pre-processing step of data mining to solve the SAT problem. (C) 2020 Elsevier B.V. All rights reserved.

Keywords:

Satisfiability problem

Computational complexity

Problem solving

Data mining techniques

Data distribution

Grid clustering

BSO

DPLL

Grid based clustering for satisfiability solving

Abstract

AI Summary

Journal

Organization

Cited Papers