6 citations · 6 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.LO2016★ 6 cited
Fuzzy Maximum Satisfiability
Mohamed El Halaby, Areeg Abdalla
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to Łukasiewicz logic. The MaxSAT problem for a set of formulae Φ is the problem of finding an assignment to the…