Results 21 to 30 of about 62,255 (228)
Adversarial satisfiability problem [PDF]
Journal of Statistical Mechanics: Theory and Experiment, 2011 We study the adversarial satisfiability problem, where the adversary can choose whether variables are negated in clauses or not in order to make the resulting formula unsatisfiable. This is one case of a general class of adversarial optimization problems that often arise in practice and are algorithmically much harder than the standard optimization ...
Castellana, Michele, Zdeborová, Lenka
openaire +3 more sources
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
Mathematics, 2022 Real life logical rule is not always satisfiable in nature due to the redundant variable that represents the logical formulation. Thus, the intelligence system must be optimally governed to ensure the system can behave according to non-satisfiable ...
Vikneswari Someetheram +6 more
doaj +1 more source
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits [PDF]
, 2013 We give a nontrivial algorithm for the satisfiability problem for cn-wire threshold circuits of depth two which is better than exhaustive search by a factor 2^{sn} where s= 1/c^{O(c^2)}.
Impagliazzo, Russell +2 more
core +1 more source
Predicting Propositional Satisfiability via End-to-End Learning
AAAI Conference on Artificial Intelligence, 2020 Strangely enough, it is possible to use machine learning models to predict the satisfiability status of hard SAT problems with accuracy considerably higher than random guessing.
Chris Cameron +3 more
semanticscholar +1 more source
Discrete Applied Mathematics, 2012 31 pages, added the 4.419 upper-bound on the ...
Boufkhad, Yacine, Hugel, Thomas
openaire +4 more sources
On Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
Моделирование и анализ информационных систем, 2018 The blockchain technology is based on the ”Proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant after the confirmation by a certain computer work.
Valeriy G. Durnev +3 more
doaj +1 more source
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj +1 more source
Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant
Physics Letters B, 2021 We apply Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers in the context of finding chiral heterotic string models with positive cosmological constant from Z2×Z2 orbifolds.
Alon E. Faraggi +3 more
doaj +1 more source
SAT-based Explicit LTL Reasoning [PDF]
, 2015 We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving.
AR Bradley +25 more
core +1 more source