Search Result for "satisfiability problem":
perl: warning: Please check that your locale settings:
	LANGUAGE = (unset),
	LC_ALL = (unset),
	LC_TIME = "tr_TR.UTF-8",
	LC_MONETARY = "tr_TR.UTF-8",
	LC_ADDRESS = "tr_TR.UTF-8",
	LC_TELEPHONE = "tr_TR.UTF-8",
	LC_NAME = "tr_TR.UTF-8",
	LC_MEASUREMENT = "tr_TR.UTF-8",
	LC_IDENTIFICATION = "tr_TR.UTF-8",
	LC_NUMERIC = "tr_TR.UTF-8",
	LC_PAPER = "tr_TR.UTF-8",
	LANG = "C"
    are supported and installed on your system.
perl: warning: Falling back to the standard locale ("C").
1 definitions retrieved:

The Free On-line Dictionary of Computing (18 March 2015):

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)