.. This file is part of the OpenDSA eTextbook project. See
.. http://opendsa.org for more details.
.. Copyright (c) 2012-2020 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. avmetadata::
   :title: 3-CNF Satisfiability
   :author: Nabanita Maji
   :institution: Virginia Tech
   :topic: NP-completeness
   :keyword: NP-Complete; Satisfiability Problem
   :naturallanguage: en
   :programminglanguage: N/A
   :description: Presents the 3-CNF Satisfiability problem. Includes an exercise to practice finding satisfiable truth settings.

3-CNF Satisfiability
====================

3-CNF Satisfiability (3-SAT)
----------------------------

.. inlineav:: threeSATCON ss
   :long_name: 3-Satisfiability
   :links: AV/NP/threeSATCON.css
   :scripts: AV/NP/threeSATCON.js
   :output: show
   :keyword: NP-completeness; 3-CNF Satisfiabilty

Try out an instance of the 3-SAT problem on your own.

.. avembed:: Exercises/NP/threeSATPRO.html ka
   :long_name: Practice Exercise for 3-SAT
   :keyword: NP-completeness; 3-CNF Satisfiabilty