Results 141 to 150 of about 2,334 (179)

Centrality-Based Improvements to CDCL Heuristics

2018
There are many reasons to think that SAT solvers should be able to exploit formula structure, but no standard techniques in modern CDCL solvers make explicit use of structure. We describe modifications to modern decision and clause-deletion heuristics that exploit formula structure by using variable centrality.
Sima Jamali, David Mitchell
openaire   +1 more source

Design, implementation and evaluation of a distributed CDCL framework. [PDF]

, 2017
The primary subject of this dissertation is practically solving instances of the Boolean satisfiability problem (SAT) that arise from industrial applications. The invention of the conflict-driven clause-learning (CDCL) algorithm led to enormous progress in this field.
openaire   +2 more sources

Using Resolution Proofs to Analyse CDCL Solvers

2020
We propose that CDCL SAT solver heuristics such as restarts and clause database management can be analysed by studying the resolution proofs produced by the solvers, and by trimming these proofs to extract the clauses actually used to reach the final conclusion.
Janne I. Kokkala, Jakob Nordström
openaire   +2 more sources

CDCL with Less Destructive Backtracking through Partial Ordering

EPiC Series in Computing, 2018
Conflict-driven clause learning is currently the most efficient complete algorithm for satisfiability solving. However, a conflict-directed backtrack deletes potentially large portions of the current assignment that have no direct relation with the conflict.
Anthony Monnet, Roger Villemaire
openaire   +1 more source

On Q-Resolution and CDCL QBF Solving

2016
The proof system Q-resolution and its variations provide the underlying proof systems for the DPLL-based QBF solvers. While (long-distance) Q-resolution models a conflict driven clause learning (CDCL) QBF solver, the inverse relation is not well understood.
openaire   +2 more sources

Design and implementation of modern CDCL ASP solvers

Intelligenza Artificiale: The international journal of the AIxIA
Answer Set Programming (ASP) is a declarative language oriented towards solving complex combinatorial problems. In fact, ASP has been successfully used to address problems in various academic and industrial domains. The success of ASP can be attributed to its concise syntax, intuitive semantics, and the availability of several efficient solvers based ...
openaire   +2 more sources

???????????????????? ???????????????????????? ?????????????????? ???? ?????????????????? ?????? CdCl??? ???? ?????????????????????? ?????????????????? ???????????? ?? ?????????????????????????????? ?????? ???????????????????????????????????????? ???????????????? ?????????? ??????????

2018
Toxicokinetics and toxicodynamics of cadmium chloride and cadmium and metallothionein complex (Cd???-MT) was investigated during the experiment on laboratory animals (rats, mice) in case of single intraperitoneal administration. It was shown that in case of administration of these compounds induction of MT synthesis in liver and kidneys and also ...
openaire   +1 more source

Empirical Study of the Behavior of Conflict Analysis in CDCL Solvers

2013
The Conflict Driven Clause Learning (CDCL) Boolean Satisfiability (SAT) solvers are very effective in solving large and numerous crafted and industrial instances. Paradoxically, we do not know much about the reasons for their effectiveness and their running is hard to trace.
Djamal Habet, Donia Toumi
openaire   +1 more source

Coverage-Based Clause Reduction Heuristics for CDCL Solvers

2017
Many heuristics, such as decision, restart, and clause reduction heuristics, are incorporated in CDCL solvers in order to improve performance. In this paper, we focus on learnt clause reduction heuristics, which are used to suppress memory consumption and sustain propagation speed.
Hidetomo Nabeshima, Katsumi Inoue
openaire   +1 more source

Local Search and Its Application in CDCL/CDCL(T) solvers for SAT/SMT

2023
openaire   +1 more source