Results 11 to 20 of about 18,622 (181)
Revisiting Maximum Satisfiability and Related Problems in Data Streams [PDF]
Theoretical Computer Science, 2022 We revisit the MaxSAT problem in the data stream model. In this problem, the stream consists of $m$ clauses that are disjunctions of literals drawn from $n$ Boolean variables. The objective is to find an assignment to the variables that maximizes the number of satisfied clauses. Chou et al.
Hoa T. Vu
+6 more sources
Branch Location Problems with Maximum Satisfiability
, 2020 Oleg Zaikin +2 more
openalex +2 more sources
Approximating the Backbone in the Weighted Maximum Satisfiability Problem [PDF]
CoRR, 2017 The weighted Maximum Satisfiability problem (weighted MAX-SAT) is a NP-hard problem with numerous applications arising in artificial intelligence. As an efficient tool for heuristic design, the backbone has been applied to heuristics design for many NP-hard problems.
He Jiang, Jifeng Xuan, Yan Hu
openalex +3 more sources
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
Journal on Satisfiability, Boolean Modeling and Computation, 2005 Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatorial problems in particular, semidefinite programming has had a truly significant impact.
Miguel F. Anjos
openalex +3 more sources
torchmSAT: A GPU-Accelerated Approximation To The Maximum Satisfiability Problem [PDF]
CoRRThe remarkable achievements of machine learning techniques in analyzing discrete structures have drawn significant attention towards their integration into combinatorial optimization algorithms. Typically, these methodologies improve existing solvers by injecting learned models within the solving loop to enhance the efficiency of the search process. In
Abdelrahman Hosny, Sherief Reda
openalex +3 more sources
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
Journal of Artificial Intelligence Research, 2009 The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginals over covers that represent clusters of solutions. The SP-y algorithm generalizes SP to work on the maximum satisfiability (Max-SAT) problem, but the cover interpretation of ...
H.L. Chieu, W.S. Lee
openalex +4 more sources
New Length Dependent Algorithm for Maximum Satisfiability Problem
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 In this paper, we study the computational complexity of the Maximum Satisfiability problem in terms of the length L of a given formula. We present an algorithm with running time O(1.0927^L), hence, improving the previously known best upper bound O(1.1058^L) developed more than 20 years ago by Bansal and Raman.
Vasily Alferov, Ivan Bliznets
openalex +3 more sources
Inference and certificates for the maximum satisfiability problem
, 2021 Dans cette thèse, on s'intéresse au problème de satisfiabilité maximum, ou problème Max-SAT, qui consiste, étant donnée une formule propositionnelle sous forme normale conjonctive, à trouver une interprétation des variables de la formule permettant de satisfaire le plus de clauses possible, ou, de manière équivalente, de falsifier le moins de clauses ...
M. Py
openalex +3 more sources
Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations
Journal of Logic and Computation, 2022 Abstract MaxSAT, the optimization version of the well-known SAT problem, has attracted a lot of research interest in the past decade. Motivated by the many important applications and inspired by the success of modern SAT solvers, researchers have developed many MaxSAT solvers.
Emma Rollón, Javier Larrosa
openalex +5 more sources
A Multilevel Evolutionary Algorithm Applied to the Maximum Satisfiability Problems
, 2018 Noureddine Bouhmala +2 more
openalex +3 more sources