Author:
Bayless Sam,Bayless Noah,Hoos Holger,Hu Alan
Abstract
Boolean satisfiability (SAT) solvers have been successfully applied to a wide variety of difficult combinatorial problems. Many further problems can be solved by SAT Modulo Theory (SMT) solvers, which extend SAT solvers to handle additional types of constraints. However, building efficient SMT solvers is often very difficult. In this paper, we define the concept of a Boolean monotonic theory and show how to easily build efficient SMT solvers, including effective theory propagation and clause learning, for such theories. We present examples showing useful constraints that are monotonic, including many graph properties (e.g., shortest paths), and geometric properties (e.g., convex hulls). These constraints arise in problems that are otherwise difficult for SAT solvers to handle, such as procedural content generation. We have implemented several monotonic theory solvers using the techniques we present in this paper and applied these to content generation problems, demonstrating major speed-ups over SAT, SMT, and Answer Set Programming solvers, easily solving instances that were previously out of reach.
Publisher
Association for the Advancement of Artificial Intelligence (AAAI)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories;Lecture Notes in Computer Science;2024
2. Qobra: Fast Verification of Transactional Serializability with Quantum Annealing;2023 IEEE International Conference on Big Data (BigData);2023-12-15
3. VeriReach: A Formally Verified Algorithm for Reachability Analysis in Virtual Private Cloud Networks;2023 IEEE International Conference on Web Services (ICWS);2023-07
4. Viper: A Fast Snapshot Isolation Checker;Proceedings of the Eighteenth European Conference on Computer Systems;2023-05-08
5. Towards Reliable Infrastructure as Code;2023 IEEE 20th International Conference on Software Architecture Companion (ICSA-C);2023-03