Zobrazeno 1 - 10
of 22 788
pro vyhledávání: '"Satisfiability problem"'
Autor:
Uwe Schöning, Jacobo Torán
The satisfiability problem of propositional logic, SAT for short, is the first algorithmic problem that was shown to be NP-complete, and is the cornerstone of virtually all NP-completeness proofs. The SAT problem consists of deciding whether a given
Autor:
Hébert-Dufresne, Laurent, Landry, Nicholas W., Lovato, Juniper, St-Onge, Jonathan, Young, Jean-Gabriel, Couture-Ménard, Marie-Ève, Bernatchez, Stéphane, Choquette, Catherine, Cohen, Alan A.
Democratic governments comprise a subset of a population whose goal is to produce coherent decisions that solve societal challenges while respecting the will of the people they represent. New governance frameworks represent this problem as a social n
Externí odkaz:
http://arxiv.org/abs/2412.03421
The theory of Total Function NP (TFNP) and its subclasses says that, even if one is promised an efficiently verifiable proof exists for a problem, finding this proof can be intractable. Despite the success of the theory at showing intractability of p
Externí odkaz:
http://arxiv.org/abs/2412.19623
Autor:
Hosny, Abdelrahman, Reda, Sherief
The 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
Externí odkaz:
http://arxiv.org/abs/2402.03640
The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to
Publikováno v:
Engineering Letters. May2024, Vol. 32 Issue 5, p1004-1011. 8p.
This study presents a novel heuristic algorithm called the "Minimal Positive Negative Product Strategy" to guide the CDCL algorithm in solving the Boolean satisfiability problem. It provides a mathematical explanation for the superiority of this algo
Externí odkaz:
http://arxiv.org/abs/2310.18370
We investigate the complexity of the satisfiability problem for a modal logic expressing `knowing how' assertions, related to an agent's abilities to achieve a certain goal. We take one of the most standard semantics for this kind of logics based on
Externí odkaz:
http://arxiv.org/abs/2309.17094
Autor:
Margaryan, Stepan G.
This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF problem is polynomially reduced to the problem of finding a special cov
Externí odkaz:
http://arxiv.org/abs/2310.19833