Search Results for author:
Found 3 papers, 0 papers with code
Solving the Course-timetabling Problem of Cairo University Using Max-SAT
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 encoding them into Max-SAT.
Solving MaxSAT by Successive Calls to a SAT Solver
The Maximum Satisfiability (MaxSAT) problem is the problem of finding a truth assignment that maximizes the number of satisfied clauses of a given Boolean formula in Conjunctive Normal Form (CNF).
Fuzzy Maximum Satisfiability
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to {\L}ukasiewicz logic.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
