satisfiability problem - définition. Qu'est-ce que satisfiability problem
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est satisfiability problem - définition

PROBLEM OF DETERMINING IF A BOOLEAN FORMULA COULD BE MADE TRUE
3-satisfiability; Boolean satisfiability; 3-SAT; 3cnfsat; 3cnf; 3cnf-sat; 3SAT; Satisfiability of boolean expressions; One-in-three 3SAT; Propositional satisfiability; K-SAT; K-cnf-sat; Counted Boolean Satisfiability Problem; Boolean Satisfiability; CNFSAT; Satisfiability Problem; CNF-SAT; Boolean SAT; Boolean SAT solver; Unambiguous SAT; Unique-SAT; SAT solving; XOR-satisfiability; 1-in-3-SAT; XOR-SAT; List of SAT solvers; SAT problem; Algorithms for solving the boolean satisfiability problem; Methods for solving SAT; Parallel SAT solver; Linear SAT; Algorithms for solving SAT; Propositional satisfiability problem
  • A formula with 2 clauses may be unsatisfied (red), 3-satisfied (green), xor-3-satisfied (blue), or/and 1-in-3-satisfied (yellow), depending on the TRUE-literal count in the 1st (hor) and 2nd (vert) clause.
  • (''x'' ∨ ''x'' ∨ ''y'') ∧ (¬''x'' ∨ ¬''y'' ∨ ¬''y'') ∧ (¬''x'' ∨ ''y'' ∨ ''y'')}} reduced to a [[clique problem]]. The green vertices form a 3-clique and correspond to the satisfying assignment ''x''=FALSE, ''y''=TRUE.
  • green}} argument for each ''R'') in all lines except the first, where ''x'' ∨ ''y'' ∨ ''z'' is FALSE. '''Right:''' A simpler reduction with the same properties.

satisfiability problem         
ELEMENTARY CONCEPT OF SEMANTICS
Satisfiability problem; Satisfiable; Unsatisfiable; Satisfiability and validity; Satisfiability (logics); Finite satisfiability (logics)
A problem used as an example in complexity theory. It can be stated thus: Given a Boolean expression E, decide if there is some assignment to the variables in E such that E is true. A Boolean expression is composed of Boolean variables, (logical) negation (NOT), (logical) conjunction (AND) and parentheses for grouping. The satisfiability problem was the first problem to be proved to be NP-complete (by Cook). ["Introduction to Automata Theory, Languages, and Computation" by Hopcroft and Ullman, pub. Addison-Wesley]. (1994-11-11)
Boolean satisfiability problem         
In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE.
Satisfiable         
ELEMENTARY CONCEPT OF SEMANTICS
Satisfiability problem; Satisfiable; Unsatisfiable; Satisfiability and validity; Satisfiability (logics); Finite satisfiability (logics)
·adj That may be satisfied.

Wikipédia

Boolean satisfiability problem

In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable. On the other hand, if no such assignment exists, the function expressed by the formula is FALSE for all possible variable assignments and the formula is unsatisfiable. For example, the formula "a AND NOT b" is satisfiable because one can find the values a = TRUE and b = FALSE, which make (a AND NOT b) = TRUE. In contrast, "a AND NOT a" is unsatisfiable.

SAT is the first problem that was proved to be NP-complete; see Cook–Levin theorem. This means that all problems in the complexity class NP, which includes a wide range of natural decision and optimization problems, are at most as difficult to solve as SAT. There is no known algorithm that efficiently solves each SAT problem, and it is generally believed that no such algorithm exists; yet this belief has not been proved mathematically, and resolving the question of whether SAT has a polynomial-time algorithm is equivalent to the P versus NP problem, which is a famous open problem in the theory of computing.

Nevertheless, as of 2007, heuristic SAT-algorithms are able to solve problem instances involving tens of thousands of variables and formulas consisting of millions of symbols, which is sufficient for many practical SAT problems from, e.g., artificial intelligence, circuit design, and automatic theorem proving.