Parallel solving model for quantified boolean formula based on machine learning

被引:0
|
作者
Tao Li
Nan-feng Xiao
机构
[1] South China University of Technology,School of Computer Science and Engineering
[2] South China Agricultural University,Modern Education and Technology Center
来源
关键词
machine learning; quantified boolean formula; parallel solving; knowledge sharing; feature extraction; performance prediction;
D O I
暂无
中图分类号
学科分类号
摘要
A new parallel architecture for quantified boolean formula (QBF) solving was proposed, and the prediction model based on machine learning technology was proposed for how sharing knowledge affects the solving performance in QBF parallel solving system, and the experimental evaluation scheme was also designed. It shows that the characterization factor of clause and cube influence the solving performance markedly in our experiment. At the same time, the heuristic machine learning algorithm was applied, support vector machine was chosen to predict the performance of QBF parallel solving system based on clause sharing and cube sharing. The relative error of accuracy for prediction can be controlled in a reasonable range of 20%–30%. The results show the important and complex role that knowledge sharing plays in any modern parallel solver. It shows that the parallel solver with machine learning reduces the quantity of knowledge sharing about 30% and saving computational resource but does not reduce the performance of solving system.
引用
收藏
页码:3156 / 3165
页数:9
相关论文
共 50 条
  • [21] Solving Queries for Boolean Fault Tree Logic via Quantified SAT
    Saaltink, Caz
    Nicoletti, Stefano M.
    Volk, Matthias
    Hahn, Ernst Moritz
    Stoelinga, Marielle
    PROCEEDINGS OF THE 9TH ACM SIGPLAN INTERNATIONAL WORKSHOP ON FORMAL TECHNIQUES FOR SAFETY-CRITICAL SYSTEMS, FTSCS 2023, 2023, : 48 - 59
  • [22] Conflict driven learning in a quantified Boolean satisfiability solver
    Zhang, LT
    Malik, S
    IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, : 442 - 449
  • [23] HPC-based parallel software for solving applied Boolean satisfiability problems
    Bogdanova, V. G.
    Gorsky, S. A.
    Pashinin, A. A.
    2020 43RD INTERNATIONAL CONVENTION ON INFORMATION, COMMUNICATION AND ELECTRONIC TECHNOLOGY (MIPRO 2020), 2020, : 1006 - 1011
  • [24] Clause/term resolution and learning in the evaluation of Quantified Boolean Formulas
    Giunchiglia, Enrico
    Narizzano, Massimo
    Tacchella, Armando
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2006, 26 : 371 - 416
  • [25] Clause/term resolution and learning in the evaluation of quantified boolean formulas
    Giunchiglia, Enrico
    Narizzano, Massimo
    Tacchella, Armando
    Journal of Artificial Intelligence Research, 2006, 26 : 371 - 416
  • [26] A symbolic search based approach for quantified Boolean formulas
    Audemard, G
    Saïs, L
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 16 - 30
  • [27] Multiplication Complexity Optimization based on Quantified Boolean Formulas
    Zhu, Jun
    Pan, Hongyang
    Chu, Zhufei
    2024 INTERNATIONAL SYMPOSIUM OF ELECTRONICS DESIGN AUTOMATION, ISEDA 2024, 2024, : 332 - 336
  • [28] SAT based BDD solver for Quantified Boolean Formulas
    Audemard, G
    Saïs, L
    ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 82 - 89
  • [29] Solving the Bose-Hubbard Model with Machine Learning
    Saito, Hiroki
    JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN, 2017, 86 (09)
  • [30] Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
    Roderick Bloem
    Nicolas Braud-Santoni
    Vedad Hadzic
    Uwe Egly
    Florian Lonsing
    Martina Seidl
    Formal Methods in System Design, 2021, 57 : 157 - 177