Results 181 to 190 of about 12,229,216 (240)

On the Structure of the Boolean Satisfiability Problem: A Survey

ACM Computing Surveys, 2022
The Boolean satisfiability problem (SAT) is a fundamental NP-complete decision problem in automated reasoning and mathematical logic. As evidenced by the results of SAT competitions, the performance of SAT solvers varies substantially between different ...
T. Al-Yahya, M. Menai, H. Mathkour
semanticscholar   +1 more source

The Minimum Satisfiability Problem

SIAM Journal on Discrete Mathematics, 1994
Summary: This paper shows that a minimization version of satisfiability is strongly NP-hard, even if each clause contains no more than two literals and/or each clause contains at most one unnegated variable. The worst- case and average-case performances of greedy and probabilistic greedy heuristics for the problem are examined, and tight upper bounds ...
Kohli, Rajeev, Krishnamurti, Ramesh, Mirchandani, Prakash   +2 more
openaire   +2 more sources

The Inverse Satisfiability Problem

SIAM Journal on Computing, 1996
Summary: We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a Boolean expression of a certain type. We show that the problem is coNP-complete when the expression is required to be in conjunctive normal form with three literals per clause (3CNF).
Kavvadias, Dimitris, Sideri, Martha
openaire   +1 more source

Onk-positive satisfiability problem

Journal of Computer Science and Technology, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huang, Xiong, Li, Wei
openaire   +1 more source

Algorithms for the workflow satisfiability problem engineered for counting constraints

Journal of combinatorial optimization, 2015
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification.
David A. Cohen, J. Crampton, A. Gagarin, G. Gutin, Mark Jones   +4 more
semanticscholar   +1 more source

Approximating Satisfiable Satisfiability Problems

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Satisfiability Problem for a 4-level Quantified Syllogistic and Some Applications to Modal Logic

Italian Conference on Computational Logic, 2012
We introduce a multi-sorted stratified syllogistic, called 4LQSR, admitting variables of four sorts and a restricted form of quantification over variables of the first three sorts, and prove that it has a solvable satisfiability problem by showing that ...
Domenico Cantone, Marianna Nicolosi Asmundo   +1 more
semanticscholar   +1 more source

Solving propositional satisfiability problems

Annals of Mathematics and Artificial Intelligence, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jèroslow, Robert G., Wang, Jinchang
openaire   +2 more sources

Polynomially solvable satisfiability problems

Information Processing Letters, 1988
We address the well known satisfiability problem (SAT), i.e., the problem of checking whether a given propositional formula is satisfiable. Although the general satisfiability problem is NP-complete, some particular cases of SAT are known to be easy.
GALLO, GIORGIO ANGELO, SCUTELLA', MARIA GRAZIA   +1 more
openaire   +2 more sources

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