Satisfiability problem



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)

Tagged:

Read Also:

  • Satisfiable

    verb (used with object), satisfied, satisfying. 1. to fulfill the desires, expectations, needs, or demands of (a person, the mind, etc.); give full contentment to: The hearty meal satisfied him. 2. to put an end to (a desire, want, need, etc.) by sufficient or ample provision: The hearty meal satisfied his hunger. 3. to give […]

  • Satisfice

    verb 1. (intransitive) to act in such a way as to satisfy the minimum requirements for achieving a particular result 2. (transitive) (obsolete) to satisfy



  • Satisficing behaviour

    /ˈsætɪsˌfaɪsɪŋ/ noun 1. (economics) the form of behaviour demonstrated by firms who seek satisfactory profits and satisfactory growth rather than maximum profits

  • Satisfied

    adjective 1. content: a satisfied look. 2. completely paid, as a bill. 3. convinced, as in an argument: Their opponents were finally satisfied. verb (used with object), satisfied, satisfying. 1. to fulfill the desires, expectations, needs, or demands of (a person, the mind, etc.); give full contentment to: The hearty meal satisfied him. 2. to […]



Disclaimer: Satisfiability problem definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.