scholarly journals On Reducing Clause DataBase in Glucose

10.29007/b8kb ◽  
2018 ◽  
Author(s):  
Chu Min Li ◽  
Fan Xiao ◽  
Ruchu Xu

Modern CDCL SAT solvers generally save the variable value when backtracking. We propose a new measure called nbSAT based on the saved assignment to predict the usefulness of a learnt clause when reducing clause database in Glucose 3.0. Roughly speaking, The nbSAT value of a learnt clause is equal to the number of literals satised by the current partial assignment plus the number of other literals that would be satised by the saved assignment. We study the nbSAT measure by empirically show that it may be more accurate than the LBD measure originally used in Glucose. Based on this study, we implement an improvement in Glucose 3.0 to remove half of learnt clauses with large nbSAT values instead of half of clauses with large LBD values. This improvement, together with a resolution method to keep the learnt clauses or resolvents produced using a learnt clause that subsume an original clause, makes Glucose 3.0 more eective for the application and crafted instances from the SAT 2014 competition.

1980 ◽  
Vol 3 (2) ◽  
pp. 235-268
Author(s):  
Ewa Orłowska

The central method employed today for theorem-proving is the resolution method introduced by J. A. Robinson in 1965 for the classical predicate calculus. Since then many improvements of the resolution method have been made. On the other hand, treatment of automated theorem-proving techniques for non-classical logics has been started, in connection with applications of these logics in computer science. In this paper a generalization of a notion of the resolution principle is introduced and discussed. A certain class of first order logics is considered and deductive systems of these logics with a resolution principle as an inference rule are investigated. The necessary and sufficient conditions for the so-called resolution completeness of such systems are given. A generalized Herbrand property for a logic is defined and its connections with the resolution-completeness are presented. A class of binary resolution systems is investigated and a kind of a normal form for derivations in such systems is given. On the ground of the methods developed the resolution system for the classical predicate calculus is described and the resolution systems for some non-classical logics are outlined. A method of program synthesis based on the resolution system for the classical predicate calculus is presented. A notion of a resolution-interpretability of a logic L in another logic L ′ is introduced. The method of resolution-interpretability consists in establishing a relation between formulas of the logic L and some sets of formulas of the logic L ′ with the intention of using the resolution system for L ′ to prove theorems of L. It is shown how the method of resolution-interpretability can be used to prove decidability of sets of unsatisfiable formulas of a given logic.


2021 ◽  
Vol 63 (12) ◽  
pp. 2178-2188
Author(s):  
A. Yu. Маtrosova ◽  
V. А. Provkin ◽  
V. Z. Tychinskiy ◽  
Е. А. Nikolaeva ◽  
G. G. Goshin
Keyword(s):  

1987 ◽  
Vol 28 (5) ◽  
pp. 521-522 ◽  
Author(s):  
Kenneth E Rittle ◽  
Ben E Evans ◽  
Mark G Bock ◽  
Robert M DiPardo ◽  
Willie L Whitter ◽  
...  
Keyword(s):  

2009 ◽  
Author(s):  
Ryoichi Hirano ◽  
Masatoshi Hirono ◽  
Riki Ogawa ◽  
Nobutaka Kikuiri ◽  
Kenichi Takahara ◽  
...  

2013 ◽  
Vol 7 (3) ◽  
pp. 418-431 ◽  
Author(s):  
Xiaomei Zhong ◽  
Yang Xu ◽  
Jun Liu ◽  
Shuwei Chen

Sign in / Sign up

Export Citation Format

Share Document