Login / Signup

Reducing a 3-SAT Instance to a Set of 2-SAT Instances Using the Idea of Set Covering Problem.

Sardar Anisul HaqueAli JaouaJihad Mohamad Al Ja'amHafeez Ur Rehman
Published in: ICCA (2023)
Keyphrases
  • sat instances
  • set covering problem
  • sat solvers
  • satisfiability problem
  • set covering
  • randomly generated
  • bi objective
  • search algorithm
  • evolutionary algorithm
  • sat problem
  • boolean formula