Reweighted belief propagation and quiet planting for random K-SAT
, 2014 We study the random K-satisfiability problem using a partition function where each solution is reweighted according to the number of variables that satisfy every clause.
Krzakala, Florent +2 more
core +1 more source
Le Matematiche, 2005 MLSS is a decidable sublanguage of set theory involving the predicates membership, set equality, set inclusion, and the operators union, intersection, set difference, and singleton.In this paper we extend MLSS with constructs for expressing monotonicity,
Domenico Cantone +2 more
doaj
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.
openaire +2 more sources
A logic for reasoning about upper probabilities
, 2002 We present a propositional logic %which can be used to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event.
Halpern, Joseph Y., Pucella, Riccardo
core +4 more sources
A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem
International Joint Conference on Artificial Intelligence, 2017 Jean-Marie Lagniez +3 more
semanticscholar +1 more source
Generalized Satisfiability Problems
, 2001 In the last 40 years, complexity theory has grown to a rich and powerful field in theoretical computer science. The main task of complexity theory is the classification of problems with respect to their consumption of resources (e.g., running time or required memory).
openaire +1 more source
Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming. [PDF]
PLoS One, 2019 Schawe H, Bleim R, Hartmann AK.
europepmc +1 more source
Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]
PLoS One, 2023 Ali GA +5 more
europepmc +1 more source
Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. [PDF]
Springerplus, 2016 Semenov A, Zaikin O.
europepmc +1 more source
Augmenting an electronic Ising machine to effectively solve boolean satisfiability. [PDF]
Sci Rep, 2023 Sharma A, Burns M, Hahn A, Huang M.
europepmc +1 more source