Results 181 to 190 of about 18,245 (221)
GRASP-A Search Algorithm for Propositional Satisfiability
, 1999 Marques-Silva, J. P., Sakallah, K. A.
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Sums of Squares, Satisfiability and Maximum Satisfiability
2005Recently the Mathematical Programming community showed a renewed interest in Hilbert's Positivstellensatz. The reason for this is that global optimization of polynomials in ℝ[x1,...,xn] is $\mathcal{NP}$-hard, while the question whether a polynomial can be written as a sum of squares has tractable aspects.
Hans van Maaren, Linda van Norden
openaire +1 more source
Approximating Satisfiable Satisfiability Problems
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies a number of desired output (label/response) constraints. LSAT problems naturally arise in many applications in which one is interested in the class of inputs that produce ...
Frederic Thouin +4 more
openaire +1 more source
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies a number of desired output (label/response) constraints. LSAT problems naturally arise in many applications in which one is interested in the class of inputs that produce ...
Frederic Thouin +4 more
openaire +1 more source
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 +2 more sources
On the satisfiability of circumscription
Artificial Intelligence, 1986Es wird gezeigt: Wenn A erfüllbar ist und fast universal bezüglich P, so ist Circum(A;P) erfüllbar. Wenn A universal und erfüllbar ist, so ist Circum(A;P;Q) erfüllbar. Für disjunkte \(P^ 1,...,P^ k\), Q und jedes universale, erfüllbare A ist Circum(A,\(P^ 1>...>P^ k,Q)\) erfüllbar.
openaire +2 more sources
Equation Satisfiability and Program Satisfiability for Finite Monoids
2000We study the computational complexity of solving equations and of determining the satisfiability of programs over a fixed finite monoid. We partially answer an open problem of [4] by exhibiting quasi-polynomial time algorithms for a subclass of solvable nonnilpotent groups and relate this question to a natural circuit complexity conjecture.
David A. Mix Barrington +4 more
openaire +1 more source
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009
We give a simple introduction to satisfiability modulo theories intended fornon-specialists. No previous background is assumed.
openaire +1 more source
We give a simple introduction to satisfiability modulo theories intended fornon-specialists. No previous background is assumed.
openaire +1 more source
Studia Logica, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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 ...
Ramamohan Paturi +2 more
openaire +4 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 ...
Ramamohan Paturi +2 more
openaire +4 more sources