International Conference on Theory and Applications of Satisfiability Testing最新文献

Certified CNF Translations for Pseudo-Boolean Solving 伪布尔解的认证CNF翻译

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2023-08-01 DOI: 10.4230/LIPIcs.SAT.2022.16

S. Gocht, R. Martins, J. Nordström, A. Oertel

引用次数: 7

Algorithms Transcending the SAT-Symmetry Interface 超越sat -对称接口的算法

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2023-06-01 DOI: 10.48550/arXiv.2306.00613

Markus Anders, Pascal Schweitzer, M. Soos

{"title":"Algorithms Transcending the SAT-Symmetry Interface","authors":"Markus Anders, Pascal Schweitzer, M. Soos","doi":"10.48550/arXiv.2306.00613","DOIUrl":"https://doi.org/10.48550/arXiv.2306.00613","url":null,"abstract":"Dedicated treatment of symmetries in satisfiability problems (SAT) is indispensable for solving various classes of instances arising in practice. However, the exploitation of symmetries usually takes a black box approach. Typically, off-the-shelf external, general-purpose symmetry detection tools are invoked to compute symmetry groups of a formula. The groups thus generated are a set of permutations passed to a separate tool to perform further analyzes to understand the structure of the groups. The result of this second computation is in turn used for tasks such as static symmetry breaking or dynamic pruning of the search space. Within this pipeline of tools, the detection and analysis of symmetries typically incurs the majority of the time overhead for symmetry exploitation. In this paper we advocate for a more holistic view of what we call the SAT-symmetry interface. We formulate a computational setting, centered around a new concept of joint graph/group pairs, to analyze and improve the detection and analysis of symmetries. Using our methods, no information is lost performing computational tasks lying on the SAT-symmetry interface. Having access to the entire input allows for simpler, yet efficient algorithms. Specifically, we devise algorithms and heuristics for computing finest direct disjoint decompositions, finding equivalent orbits, and finding natural symmetric group actions. Our algorithms run in what we call instance-quasi-linear time, i.e., almost linear time in terms of the input size of the original formula and the description length of the symmetry group returned by symmetry detection tools. Our algorithms improve over both heuristics used in state-of-the-art symmetry exploitation tools, as well as theoretical general-purpose algorithms.","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117245712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Bounds on BDD-Based Bucket Elimination 基于bdd的桶消除的边界

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2023-06-01 DOI: 10.48550/arXiv.2306.00886

S. Mengel

引用次数: 1

Deep Cooperation of CDCL and Local Search for SAT CDCL与SAT局部搜索的深度合作

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2022-07-01 DOI: 10.1007/978-3-030-80223-3_6

Shaowei Cai, Xindi Zhang

引用次数: 12

Weighted Model Counting with Twin-Width 双宽度加权模型计数

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2022-06-03 DOI: 10.48550/arXiv.2206.01706

R. Ganian, Filip Pokr'yvka, André Schidler, Kirill Simonov, Stefan Szeider

{"title":"Weighted Model Counting with Twin-Width","authors":"R. Ganian, Filip Pokr'yvka, André Schidler, Kirill Simonov, Stefan Szeider","doi":"10.48550/arXiv.2206.01706","DOIUrl":"https://doi.org/10.48550/arXiv.2206.01706","url":null,"abstract":"Bonnet et al. (FOCS 2020) introduced the graph invariant twin-width and showed that many NP-hard problems are tractable for graphs of bounded twin-width, generalizing similar results for other width measures, including treewidth and clique-width. In this paper, we investigate the use of twin-width for solving the propositional satisfiability problem (SAT) and propositional model counting. We particularly focus on Bounded-ones Weighted Model Counting (BWMC), which takes as input a CNF formula $F$ along with a bound $k$ and asks for the weighted sum of all models with at most $k$ positive literals. BWMC generalizes not only SAT but also (weighted) model counting. We develop the notion of\"signed\"twin-width of CNF formulas and establish that BWMC is fixed-parameter tractable when parameterized by the certified signed twin-width of $F$ plus $k$. We show that this result is tight: it is neither possible to drop the bound $k$ nor use the vanilla twin-width instead if one wishes to retain fixed-parameter tractability, even for the easier problem SAT. Our theoretical results are complemented with an empirical evaluation and comparison of signed twin-width on various classes of CNF formulas.","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122786716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

On the Parallel Parameterized Complexity of MaxSAT Variants MaxSAT变量并行参数化复杂度研究

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2022-06-02 DOI: 10.48550/arXiv.2206.01280

Max Bannach, Malte Skambath, Till Tantau

{"title":"On the Parallel Parameterized Complexity of MaxSAT Variants","authors":"Max Bannach, Malte Skambath, Till Tantau","doi":"10.48550/arXiv.2206.01280","DOIUrl":"https://doi.org/10.48550/arXiv.2206.01280","url":null,"abstract":"In the maximum satisfiability problem (MAX-SAT) we are given a propositional formula in conjunctive normal form and have to find an assignment that satisfies as many clauses as possible. We study the parallel parameterized complexity of various versions of MAX-SAT and provide the first constant-time algorithms parameterized either by the solution size or by the allowed excess relative to some guarantee (\"above guarantee\"versions). For the dual parameterized version where the parameter is the number of clauses we are allowed to leave unsatisfied, we present the first parallel algorithm for MAX-2SAT (known as ALMOST-2SAT). The difficulty in solving ALMOST-2SAT in parallel comes from the fact that the iterative compression method, originally developed to prove that the problem is fixed-parameter tractable at all, is inherently sequential. We observe that a graph flow whose value is a parameter can be computed in parallel and use this fact to develop a parallel algorithm for the vertex cover problem parameterized above the size of a given matching. Finally, we study the parallel complexity of MAX-SAT parameterized by the vertex cover number, the treedepth, the feedback vertex set number, and the treewidth of the input's incidence graph. While MAX-SAT is fixed-parameter tractable for all of these parameters, we show that they allow different degrees of possible parallelization. For all four we develop dedicated parallel algorithms that are constructive, meaning that they output an optimal assignment - in contrast to results that can be obtained by parallel meta-theorems, which often only solve the decision version.","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125003963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SAT Preprocessors and Symmetry SAT预处理器和对称性

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2022-05-25 DOI: 10.48550/arXiv.2205.12799

Markus Anders

{"title":"SAT Preprocessors and Symmetry","authors":"Markus Anders","doi":"10.48550/arXiv.2205.12799","DOIUrl":"https://doi.org/10.48550/arXiv.2205.12799","url":null,"abstract":"Exploitation of symmetries is an indispensable approach to solve certain classes of difficult SAT instances. Numerous techniques for the use of symmetry in SAT have evolved over the past few decades. But no matter how symmetries are used precisely, they have to be detected first. We investigate how to detect more symmetry, faster. The initial idea is to reap the benefits of SAT preprocessing for symmetry detection. As it turns out, applying an off-the-shelf preprocessor before handling symmetry runs into problems: the preprocessor can haphazardly remove symmetry from formulas, severely impeding symmetry exploitation. Our main contribution is a theoretical framework that captures the relationship of SAT preprocessing techniques and symmetry. Based on this, we create a symmetry-aware preprocessor that can be applied safely before handling symmetry. We then demonstrate that applying the preprocessor does not only substantially decrease symmetry detection and breaking times, but also uncovers hidden symmetry not detectable in the original instances. Overall, we depart the conventional view of treating symmetry detection as a black-box, presenting a new application-specific approach to symmetry detection in SAT.","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129034683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Certified DQBF Solving by Definition Extraction 基于定义提取的认证DQBF求解

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2021-06-04 DOI: 10.1007/978-3-030-80223-3_34

F. Reichl, Friedrich Slivovsky, Stefan Szeider

引用次数: 5

Proof Complexity of Symbolic QBF Reasoning 符号QBF推理的证明复杂性

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2021-04-06 DOI: 10.1007/978-3-030-80223-3_28

S. Mengel, Friedrich Slivovsky

引用次数: 1

On the Hierarchical Community Structure of Practical Boolean Formulas 实用布尔公式的层次社团结构

International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2021-03-27 DOI: 10.1007/978-3-030-80223-3_25

Chunxiao Li, Jonathan Chung, Shubhabrata Mukherjee, Marc Vinyals, Noah Fleming, A. Kolokolova, Alice Mu, Vijay Ganesh

引用次数: 2