The not-all-equal satisfiability (NAESAT) problem is an important extension of the satisfiability (SAT) problem. It has an important application in many NP-complete problems, such as the SET SPLITTING problem and the MAXCUT problem. An exact algorithm NAE based on Davis-Putnam-Logema...