Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:
Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT
In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:
- come viene usata la parola
- frequenza di utilizzo
- è usato più spesso nel discorso orale o scritto
- opzioni di traduzione delle parole
- esempi di utilizzo (varie frasi con traduzione)
- etimologia
Cosa (chi) è satisfiable$72178$ - definizione
Equisatisfiability
In Mathematical logic (a subtopic within the field of formal logic), two formulae are equisatisfiable if the first formula is satisfiable whenever the second is and vice versa; in other words, either both formulae are satisfiable or both are not. Equisatisfiable formulae may disagree, however, for a particular choice of variables.
Satisfiable
ELEMENTARY CONCEPT OF SEMANTICS
Satisfiability problem; Satisfiable; Unsatisfiable; Satisfiability and validity; Satisfiability (logics); Finite satisfiability (logics)
·adj That may be satisfied.
satisfiability problem
![(''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.](https://commons.wikimedia.org/wiki/Special:FilePath/Sat reduced to Clique from Sipser.svg?width=200 "(''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.")
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)
