Results 141 to 150 of about 1,567 (182)

Approximating satisfiable satisfiability problems

1997
We 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

On the satisfiability of circumscription

Artificial Intelligence, 1986
Es 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

2000
We 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, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien   +4 more
openaire   +1 more source

Satisfiability and Theories

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

Satisfiability Coding Lemma

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, Pavel Pudlák, Francis Zane   +2 more
openaire   +3 more sources

Satisfiability on hypergraphs

Studia Logica, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

From Propositional Satisfiability to Satisfiability Modulo Theories

2006
In this paper we present a review of SAT-based approaches for building scalable and efficient decision procedures for quantifier-free first-order logic formulas in one or more decidable theories, known as Satisfiability Modulo Theories (SMT) problems.
Hossein M. Sheini, Karem A. Sakallah
openaire   +1 more source

Satisfiability versus Finite Satisfiability in Elementary Modal Logics

Fundamenta Informaticae, 2018
We study variants of the satisfiability problem of elementary modal logics, i.e., modal logic considered over first-order definable classes of frames. The standard semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite structures.
Jakub Michaliszyn, Jan Otop, Piotr Witkowski 0001   +2 more
openaire   +1 more source

Efficient Temporal Satisfiability

Journal of Logic and Computation, 1992
The 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
E. Allen Emerson, Tom Sadler, Jai Srinivasan   +2 more
openaire   +2 more sources

Stochastic Boolean Satisfiability

Journal of Automated Reasoning, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael L. Littman, Stephen M. Majercik, Toniann Pitassi   +2 more
openaire   +2 more sources