Abstract: Boolean satisfiability (SAT), the first proven nondeterministic polynominal-complete problem, is crucial in dataintensive applications. Different applications have a wide spectrum of SAT ...

An ESLint plugin that enforces logical consistency by transforming negated boolean expressions according to De Morgan’s laws. This plugin automatically rewrites negated conjunctions and disjunctions ...