The Multi-SAT Algorithm
نویسنده
چکیده
Many e cient algorithms have been developed for satis ability testing. They complement rather than exclude each other by being e ective for particular problem instances. In this research, we give a Multi-SAT algorithm for the SAT problem. The Multi-SAT algorithm integrates several e cient SAT algorithms. It makes use of di erent algorithmic niches for satisability testing. Based on cost-e ective cluster computing, Multi-SAT can perform simultaneous satis ability testing, using several “stones” to shoot one “bird”. The software architecture for Multi-SAT has been designed. A number of software tools have been developed. This software tool kit can support e cient satis ability testing with uncertain problem structure, facilitating multiple tracking of an algorithm structure, and allow a detailed study of the entire problem spectrum. It provides a cost-e ective multi-tool kit for practical satis ability testing. ? 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Multi-Resource Scheduling with Consideration of Differential Services in Multi-Tenant Sharing
Current schedulers in the cloud computing platform are facing the performance requirement. However, due to lack of the theoretical and practical guidance on multi-resource scheduling, algorithms in the schedulers are neglecting the difference between resource demand vectors and resource demand flow, resulting into the large resource waste caused by fragmentation, with all tasks struggling with ...
متن کاملAlgorithm Configuration for Portfolio-based Parallel SAT-Solving
Since 2004, the increases in processing power enabled by Moore’s law have been primarily achieved by means of multi-core processor architectures. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for SAT, one of the most widely studied NP...
متن کاملImproving SAT Solver Efficiency Using a Multi-Core Approach
Many practical problems in multiple fields can be converted to a SAT problem, or a sequence of SAT problems, such that their solution immediately implies a solution to the original problem. Despite the enormous progress achieved over the last decade in the development of SAT solvers, there is strong demand for higher algorithm efficiency to solve harder and larger problems. The widespread avail...
متن کاملDistributed Nonmonotonic Multi-Context Systems
We present a distributed algorithm for computing equilibria of heterogeneous nonmonotonic multi-context systems (MCS). The algorithm can be parametrized to compute only partial equilibria, which can be used for reasoning tasks like query answering or satisfiability checking that need only partial information and not whole belief states. Furthermore, caching is employed to cut redundant solver c...
متن کاملModifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants
In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SATbased approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unboundedand bounded-suboptimal algorithms and compare them to relevant search-based algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 96-97 شماره
صفحات -
تاریخ انتشار 1999