scholarly journals Practical Aspects of SAT Solving

10.29007/kbw9 ◽  
2018 ◽  
Author(s):  
Armin Biere
Keyword(s):  
Automated Reasoning ◽  
Sat Solving ◽  
Current Trends ◽  
Recent Developments ◽  
Clause Learning ◽  
Sat Solver

SAT solving techniques are used in many automated reasoning engines. This talk gives an overview on recent developments in practical aspects of SAT solver development. Beside improvements of the basic conflict driven clause learning (CDCL) algorithm, we also discuss improving and integrating advanced preprocessing techniques as inprocessing during search. The talk concludes with a brief overview on current trends in parallelizing SAT.

scholarly journals Practical Aspects of SAT Solving

10.29007/hnks ◽  
2018 ◽  
Author(s):  
Armin Biere
Keyword(s):  
Automated Reasoning ◽  
Sat Solving ◽  
Current Trends ◽  
Recent Developments ◽  
Clause Learning ◽  
Sat Solver

SAT solving techniques are used in many automated reasoning engines. This talk gives an overview on recent developments in practical aspects of SAT solver development. Beside improvements of the basic conflict driven clause learning (CDCL) algorithm, we also discuss improving and integrating advanced preprocessing techniques as inprocessing during search. The talk concludes with a brief overview on current trends in parallelizing SAT.

scholarly journals Duplicates of conflict clauses in CDCL derivation and their usage to invert some cryptographic functions

2019 ◽  
pp. 54-66
Author(s):  
В.С. Кондратьев ◽  
А.А. Семенов ◽  
О.С. Заикин
Keyword(s):  
Hash Functions ◽  
Boolean Satisfiability ◽  
Experimental Results ◽  
Sat Solving ◽  
New Approach ◽  
Sat Solvers ◽  
Satisfiability Problems ◽  
Clause Learning ◽  
Sat Solver ◽  
Cryptographic Hash Functions

Изучен феномен повторного порождения конфликтных ограничений SAT-решателями в процессе работы с трудными экземплярами задачи о булевой выполнимости. Данный феномен является следствием применения эвристических механизмов чистки конфликтных баз, которые реализованы во всех современных SAT-решателях, основанных на алгоритме CDCL (Conflict Driven Clause Learning). Описана новая техника, которая позволяет отслеживать повторно порождаемые дизъюнкты и запрещать их последующее удаление. На базе предложенных технических решений построен новый многопоточный SAT-решатель (SAT, SATisfiability), который на ряде SAT-задач, кодирующих обращение криптографических хеш-функций, существенно превзошел по эффективности многопоточные решатели, занимавшие в последние годы высокие места на специализированных соревнованиях. A phenomenon of conflict clauses generated repeatedly by SAT solvers is studied. Such clauses may appear during solving hard Boolean satisfiability problems (SAT). This phenomenon is caused by the fact that the modern SAT solvers are based on the CDCL algorithm that generates conflict clauses. A database of such clauses is periodically and partially cleaned. A new approach for practical SAT solving is proposed. According to this approach, the repeatedly generated conflict clauses are tracked, whereas their further generation is prohibited. Based on this approach, a multithreaded SAT solver was developed. This solver was compared with the best multithreaded SAT solvers awarded during the last SAT competitions. According to the experimental results, the developed solver greatly outperforms its competitors on several SAT instances encoding the inversion of some cryptographic hash functions.

scholarly journals A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality

2017 ◽  
Author(s):  
Jasmin Christian Blanchette ◽  
Mathias Fleury ◽  
Christoph Weidenbach
Keyword(s):  
Proof Assistant ◽  
Sat Solving ◽  
Formal Framework ◽  
Clause Learning ◽  
Sat Solver ◽  
A Chain

We developed a formal framework for SAT solving using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL (conflict-driven clause learning) calculus is connected to a SAT solver that always terminates with correct answers. The framework offers a convenient way to prove theorems about the SAT solver and experiment with variants of the calculus. Compared with earlier verifications, the main novelties are the inclusion of the CDCL rules for forget, restart, and incremental solving and the use of refinement.

scholarly journals Russia’s Foreign Policy Evolution in the New Balkan Landscape

2020 ◽  
Vol 56 (3-4) ◽  
pp. 179-199
Author(s):  
Ekaterina Entina ◽  
Alexander Pivovarenko
Keyword(s):  
Foreign Policy ◽  
Soviet Union ◽  
Regional Security ◽  
Southeast Europe ◽  
The Balkans ◽  
Current Trends ◽  
The Soviet Union ◽  
Recent Developments ◽  
The Difference

The article reflects on the issue of the foreign policy strategy of modern Russia in the Balkans region. One of the most significant aspects of this problem is the difference in views between Russia and the West. Authors show how different interpretations of the events in former Yugoslavia in the 1990s and the beginning of the 2000s predetermined the sense of mutual suspicion and mistrust which spread to other regions such as the post-Soviet space. Exploring differences between the Russian and the Western (Euro-Atlantic) views on the current matters, authors draw attention to fundamental differences in terminology: while the Western narrative promotes more narrow geographical and political definitions (such as the Western Balkan Six), traditional Russian experts are more inclined to wider or integral definitions such as “the Balkans” and “Central and Southeast Europe”. Meanwhile none of these terms are applicable for analysis of the current trends such as the growing transit role of the Balkans region and its embedding in the European regional security architecture. Therefore, a new definition is needed to overcome the differences in vision and better understand significant recent developments in the region. Conceptualizing major foreign policy events in Central and Southeast Europe during the last three decades (the 1990s, 2000s and 2010s), authors demonstrate the significance of differences in tools and methods between the Soviet Union and the modern Russia. Permanent need for adaptation to changing political and security context led to inconsistence in Russian Balkan policy in the 1990s. Nevertheless, Russia was able to preserve an integral vision of the region and even to elaborate new transregional constructive projects, which in right political circumstances may promote stability and become beneficial for both Russia and the Euro-Atlantic community.

Metaphor Research and the Hebrew Bible

2021 ◽  
Vol 19 (3) ◽  
pp. 235-285
Author(s):  
Mason D. Lancaster
Keyword(s):  
Hebrew Bible ◽  
Conceptual Metaphor ◽  
Future Research ◽  
Conceptual Metaphor Theory ◽  
Current Trends ◽  
Metaphor Theory ◽  
Recent Developments

This article provides an overview of metaphor theories and research on their own terms, as well as their use in Hebrew Bible (HB) studies. Though metaphor studies in the HB have become increasingly popular, they often draw upon a limited or dated subset of metaphor scholarship. The first half of this article surveys a wide variety of metaphor scholarship from the humanities (philosophical, poetic, rhetorical) and the sciences (e.g., conceptual metaphor theory), beginning with Aristotle but focusing on more recent developments. The second half overviews studies of metaphor in the HB since 1980, surveying works focused on theory and method; works focused on specific biblical books or metaphor domains; and finally noting current trends and suggesting areas for future research.

scholarly journals On Division Versus Saturation in Pseudo-Boolean Solving

2019 ◽  
Author(s):  
Stephan Gocht ◽  
Jakob Nordström ◽  
Amir Yehudayoff
Keyword(s):  
Linear Programming ◽  
Cutting Planes ◽  
The Other ◽  
Sat Solving ◽  
Linear Combinations ◽  
Division Rule ◽  
Clause Learning

The conflict-driven clause learning (CDCL) paradigm has revolutionized SAT solving over the last two decades. Extending this approach to pseudo-Boolean (PB) solvers doing 0-1 linear programming holds the promise of further exponential improvements in theory, but intriguingly such gains have not materialized in practice. Also intriguingly, most PB extensions of CDCL use not the division rule in cutting planes as defined in [Cook et al., '87] but instead the so-called saturation rule. To the best of our knowledge, there has been no study comparing the strengths of division and saturation in the context of conflict-driven PB learning, when all linear combinations of inequalities are required to cancel variables. We show that PB solvers with division instead of saturation can be exponentially stronger. In the other direction, we prove that simulating a single saturation step can require an exponential number of divisions. We also perform some experiments to see whether these phenomena can be observed in actual solvers. Our conclusion is that a careful combination of division and saturation seems to be crucial to harness more of the power of cutting planes.

scholarly journals Dolius: A Distributed Parallel SAT Solving Framework

10.29007/hvqt ◽  
2018 ◽  
Author(s):  
Gilles Audemard ◽  
Benoît Hoessen ◽  
Saïd Jabbour ◽  
Cédric Piette
Keyword(s):  
Shared Memory ◽  
State Of The Art ◽  
Divide And Conquer ◽  
Sat Solving ◽  
Sat Solvers ◽  
Sat Solver

Over the years, parallel SAT solving becomes more and more important. However, most of state-of-the-art parallel SAT solvers are portfolio-based ones. They aim at running several times the same solver with different parameters. In this paper, we propose a tool called Dolius, mainly based on the divide and conquer paradigm. In contrast to most current parallel efficient engines, Dolius does not need shared memory, can be distributed, and scales well when a large number of computing units is available. Furthermore, our tool contains an API allowing to plug any SAT solver in a simple way.

Chapter 3. Complete Algorithms

2021 ◽  
Author(s):  
Adnan Darwiche ◽  
Knot Pipatsrisawat
Keyword(s):  
Real World ◽  
Theoretical Perspective ◽  
Point Of View ◽  
Sat Solving ◽  
Practical Point ◽  
Sat Solvers ◽  
Proof Systems ◽  
Real World Applications ◽  
Clause Learning

Complete SAT algorithms form an important part of the SAT literature. From a theoretical perspective, complete algorithms can be used as tools for studying the complexities of different proof systems. From a practical point of view, these algorithms form the basis for tackling SAT problems arising from real-world applications. The practicality of modern, complete SAT solvers undoubtedly contributes to the growing interest in the class of complete SAT algorithms. We review these algorithms in this chapter, including Davis-Putnum resolution, Stalmarck’s algorithm, symbolic SAT solving, the DPLL algorithm, and modern clause-learning SAT solvers. We also discuss the issue of certifying the answers of modern complete SAT solvers.

Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning

2019 ◽  
pp. 107-133
Author(s):  
Oliver Keszocze ◽  
Kenneth Schmitz ◽  
Jens Schloeter ◽  
Rolf Drechsler
Keyword(s):  
Monte Carlo ◽  
Tree Search ◽  
Sat Solving ◽  
Monte Carlo Tree Search ◽  
Clause Learning

scholarly journals Model-Free Extremum Seeking Control of Bioprocesses: A Review with a Worked Example

Processes ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1209
Author(s):  
Laurent Dewasme ◽  
Alain Vande Wouwer
Keyword(s):  
Dynamic Models ◽  
Operating Conditions ◽  
Extremum Seeking ◽  
Usual Practice ◽  
Extremum Seeking Control ◽  
Model Free ◽  
Worked Example ◽  
Current Trends ◽  
Simple Simulation ◽  
Recent Developments

Uncertainty is a common feature of biological systems, and model-free extremum-seeking control has proved a relevant approach to avoid the typical problems related to model-based optimization, e.g., time- and resource-consuming derivation and identification of dynamic models, and lack of robustness of optimal control. In this article, a review of the past and current trends in model-free extremum seeking is proposed with an emphasis on finding optimal operating conditions of bioprocesses. This review is illustrated with a simple simulation case study which allows a comparative evaluation of a few selected methods. Finally, some experimental case studies are discussed. As usual, practice lags behind theory, but recent developments confirm the applicability of the approach at the laboratory scale and are encouraging a transfer to industrial scale.

Sign in / Sign up

Export Citation Format

Share Document