Title	3-Satisfiability Proficency Exercise
Catalog Type	SLCItem
Persistent ID	https://opendsax.cs.vt.edu/OpenDSA/Exercises/NP/threeSATPRO.html
Platform Name	OpenDSA
Features	Presentation Exercise
Description	User must determine whether a given 3-CNF expression has a satisfying truth assignment or not.
Keywords	Satisfiability Problem
Author	Nabanita Maji, Cliff Shaffer
Institution	Virginia Tech
Iframe URL	https://opendsax.cs.vt.edu/OpenDSA/Exercises/NP/threeSATPRO.html
Protocol	LTI 1.1, SPLICE
Protocol URL	https://opendsax.cs.vt.edu/lti/launch?custom_ex_short_name=threeSATPRO&custom_ex_settings=%7B%7D https://opendsax.cs.vt.edu/OpenDSA/Exercises/NP/threeSATPRO.html
License	https://github.com/OpenDSA/OpenDSA/blob/master/MIT-license.txt
Programming Language	N/A
Natural Language	en

SPLICE Output