Results 181 to 190 of about 62,255 (228)
Some of the next articles are maybe not open access.
Major 2 Satisfiability Logic in Discrete Hopfield Neural Network
International Journal of Computational Mathematics, 2021Existing satisfiability (SAT) is composed of a systematic logical structure with definite literals in a set of clauses. The key problem of the existing SAT is the lack of interpretability of a logical structure that leads to low variability of the ...
Alyaa Alway +5 more
semanticscholar +1 more source
Handbook of Satisfiability, 2021
Symmetry is at once a familiar concept (we recognize it when we see it!) and a profoundly deep mathematical subject. At its most basic, a symmetry is some transformation of an object that leaves the object (or some aspect of the object) unchanged.
K. Sakallah
semanticscholar +1 more source
Symmetry is at once a familiar concept (we recognize it when we see it!) and a profoundly deep mathematical subject. At its most basic, a symmetry is some transformation of an object that leaves the object (or some aspect of the object) unchanged.
K. Sakallah
semanticscholar +1 more source
Handbook of Satisfiability, 2021
Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function to be optimized is specified by a set of weighted soft clauses: the
F. Bacchus +2 more
semanticscholar +1 more source
Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function to be optimized is specified by a set of weighted soft clauses: the
F. Bacchus +2 more
semanticscholar +1 more source
Approximating Satisfiable Satisfiability Problems
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Efficient Temporal Satisfiability
Journal of Logic and Computation, 1992The complexity of testing satisfiability of almost all extant propositional logics of programs is \(NP\)-hard, because these logics subsume ordinary propositional logic. If the conjecture \(P\neq NP\) is true, it seems likely that the best deterministic decision procedure we could hope for is of exponential time complexity. This interesting paper gives
Emerson, E. Allen +2 more
openaire +2 more sources
LinSATNet: The Positive Linear Satisfiability Neural Networks
International Conference on Machine LearningEncoding constraints into neural networks is attractive. This paper studies how to introduce the popular positive linear satisfiability to neural networks.
Runzhong Wang +5 more
semanticscholar +1 more source
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2002
Summary: In this paper, we prove a lemma that shows how to encode satisfying solutions of a \(k\)-CNF (boolean formulae in conjunctive normal form with at most \(k\) literals per clause) succinctly. Using this lemma, which we call the satisfiability coding lemma, we prove tight lower bounds on depth-3 circuits and improved upper bounds for the \(k ...
Paturi, Ramamohan +2 more
openaire +2 more sources
Summary: In this paper, we prove a lemma that shows how to encode satisfying solutions of a \(k\)-CNF (boolean formulae in conjunctive normal form with at most \(k\) literals per clause) succinctly. Using this lemma, which we call the satisfiability coding lemma, we prove tight lower bounds on depth-3 circuits and improved upper bounds for the \(k ...
Paturi, Ramamohan +2 more
openaire +2 more sources
Stochastic Boolean Satisfiability
Journal of Automated Reasoning, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Littman, Michael L. +2 more
openaire +2 more sources
Approximating satisfiable satisfiability problems
1997We study the approximability of the Maximum Satisfiability Problem (MAX SAT) and of the boolean k-ary Constraint Satisfaction Problem (MAX kCSP) restricted to satisfiable instances. For both problems we improve on the performance ratios of known algorithms for the unrestricted case.
openaire +1 more source
2009
AbstractBecause of Cook's theorem, satisfiability lies at the heart of computational complexity theory. This chapter presents some selected research directions, focusing on ensembles of random satisfiability instances. When the density of constraints is increased, a phase transition between a SAT and an UNSAT phase take place.
Marc Mézard, Andrea Montanari
openaire +1 more source
AbstractBecause of Cook's theorem, satisfiability lies at the heart of computational complexity theory. This chapter presents some selected research directions, focusing on ensembles of random satisfiability instances. When the density of constraints is increased, a phase transition between a SAT and an UNSAT phase take place.
Marc Mézard, Andrea Montanari
openaire +1 more source