IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i5p868-d1606025.html
   My bibliography  Save this article

Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems

Author

Listed:
  • Yuexin Huang

    (College of Computer and Engineering, Guilin University of Technology, Guilin 541006, China)

  • Qinzhou Niu

    (College of Computer and Engineering, Guilin University of Technology, Guilin 541006, China)

  • Yanfang Song

    (College of Arts, Guilin University of Technology, Guilin 541006, China)

Abstract

Solving satisfiability problems is central to many areas of computer science, including artificial intelligence and optimization. Efficiently solving satisfiability problems requires exploring vast search spaces, where search space partitioning plays a key role in improving solving efficiency. This paper defines search spaces and their partitioning, focusing on the relationship between partitioning strategies and satisfiability problem solving. By introducing an abstraction method for partitioning the search space—distinct from traditional assignment-based approaches—the paper proposes sequential, parallel, and hybrid solving algorithms. Experimental results show that the hybrid approach, combining abstraction and assignment, significantly accelerates solving in most cases. Furthermore, a unified method for search space partitioning is presented, defining independent and complete partitions. This method offers a new direction for enhancing the efficiency of SAT problem solving and provides a foundation for future research in the field.

Suggested Citation

  • Yuexin Huang & Qinzhou Niu & Yanfang Song, 2025. "Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems," Mathematics, MDPI, vol. 13(5), pages 1-25, March.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:868-:d:1606025
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/5/868/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/5/868/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:868-:d:1606025. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.