1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2018
Maximizing the Number of Satisfied L-clauses
Mohamed El Halaby, Areeg Abdalla
The -SAT problem for Ł-clausal forms has been found to be NP-complete if . Similar to Boolean CNF formulas, Ł-clausal forms are important from a theoretical and practic…
cs.AI2018★ 1 cited
Solving the Course-timetabling Problem of Cairo University Using Max-SAT
Mohamed El Halaby
Due to the good performance of current SAT (satisfiability) and Max-SAT (maximum ssatisfiability) solvers, many real-life optimization problems such as scheduling can be solved by…