On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas

1987 ◽  
pp. 456-469
Author(s):  
V. Arvind ◽  
S. Biswas
Keyword(s):  
Satisfiability Problem ◽  
Cnf Formulas

The satisfiability problem in regular CNF-formulas

1998 ◽  
Vol 2 (3) ◽  
pp. 116-123 ◽  
Author(s):  
F. Manyà ◽  
R. Béjar ◽  
G. Escalada-Imaz
Keyword(s):  
Satisfiability Problem ◽  
Cnf Formulas

scholarly journals Simplest randomK-satisfiability problem

2001 ◽  
Vol 63 (2) ◽  
Author(s):  
Federico Ricci-Tersenghi ◽  
Martin Weigt ◽  
Riccardo Zecchina
Keyword(s):  
Satisfiability Problem

Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

2020 ◽  
Vol 176 (3-4) ◽  
pp. 271-297
Author(s):  
Mario Alviano ◽  
Carmine Dodaro
Keyword(s):  
State Of The Art ◽  
Answer Set Programming ◽  
Efficient Algorithms ◽  
Satisfiability Problem ◽  
Core Analysis ◽  
Stable Model ◽  
Maximum Satisfiability ◽  
Model Search ◽  
Unsatisfiable Core ◽  
Stable Models

Many efficient algorithms for the computation of optimum stable models in the context of Answer Set Programming (ASP) are based on unsatisfiable core analysis. Among them, algorithm OLL was the first introduced in the context of ASP, whereas algorithms ONE and PMRES were first introduced for solving the Maximum Satisfiability problem (MaxSAT) and later on adapted to ASP. In this paper, we present the porting to ASP of another state-of-the-art algorithm introduced for MaxSAT, namely K, which generalizes ONE and PMRES. Moreover, we present a new algorithm called OLL-IN-ONE that compactly encodes all aggregates of OLL by taking advantage of shared aggregate sets propagators. The performance of the algorithms have been empirically compared on instances taken from the latest ASP Competition.

Algorithms for the maximum satisfiability problem

Computing ◽  
1990 ◽  
Vol 44 (4) ◽  
pp. 279-303 ◽  
Author(s):  
Pierre Hansen ◽  
Brigitte Jaumard
Keyword(s):  
Satisfiability Problem ◽  
Maximum Satisfiability

scholarly journals GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem

2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao
Keyword(s):  
Tabu Search ◽  
Local Search ◽  
Hybrid Algorithm ◽  
State Of The Art ◽  
Search Algorithm ◽  
Satisfiability Problem ◽  
Local Search Algorithm ◽  
Overall Performance ◽  
Genetic Local Search ◽  
Search Stage

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.

Sign in / Sign up

Export Citation Format

Share Document