header
Local cover image
Local cover image
Image from OpenLibrary

On the weighted partial maximum satis ability problem / Mohamed Hesham Mohamed Emam Elhalaby ; Supervised L. F. Abdelal , Rasha Mohamed Shaheen

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Mohamed Hesham Mohamed Emam Elhalaby , 2015Description: 195 P. : charts ; 25cmOther title:
  • دراسة بعض حالات مسألة التحقق الجزئي للصيغة البولياوية ذات الوزن الاكبر [Added title page title]
Subject(s): Online resources: Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Science - Department of Mathematics Summary: This thesis is concerned with the Weighted Partial Maximum Satis- ability problem (WPMax-SAT). Let z = zS{u222A}zH be a Boolean formula such that zS = {(C1, w1), . . . , (Cs, ws)} and zH = {(Cs+1, {u221E}), . . . , (Cs+h, {u221E})}, Ci, (1 {u2264} i {u2264} s + h) are clauses and wj, (1 {u2264} j {u2264} s + h) (called weights) is either a natural number or {u221E}. The WPMax-SAT problem for z is nding an assignment that satis es all the hard clauses and maximizes the sum of the weights of the soft clauses. We dis- cuss four aspects of WPMax-SAT. The rst is the computational complexity of the problem from the classical and the parametrized perspectives. Secondly, the two solving techniques of WPMax-SAT: branch and bound and SAT-based methods. Third, our experimental investigation on a number of selected solvers. Finally, the applica- tions of WPMax-SAT in real-life.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.12.17.M.Sc.2015.Mo.O (Browse shelf(Opens below)) Not for loan 01010110067559000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.12.17.M.Sc.2015.Mo.O (Browse shelf(Opens below)) 67559.CD Not for loan 01020110067559000

Thesis (M.Sc.) - Cairo University - Faculty of Science - Department of Mathematics

This thesis is concerned with the Weighted Partial Maximum Satis- ability problem (WPMax-SAT). Let z = zS{u222A}zH be a Boolean formula such that zS = {(C1, w1), . . . , (Cs, ws)} and zH = {(Cs+1, {u221E}), . . . , (Cs+h, {u221E})}, Ci, (1 {u2264} i {u2264} s + h) are clauses and wj, (1 {u2264} j {u2264} s + h) (called weights) is either a natural number or {u221E}. The WPMax-SAT problem for z is nding an assignment that satis es all the hard clauses and maximizes the sum of the weights of the soft clauses. We dis- cuss four aspects of WPMax-SAT. The rst is the computational complexity of the problem from the classical and the parametrized perspectives. Secondly, the two solving techniques of WPMax-SAT: branch and bound and SAT-based methods. Third, our experimental investigation on a number of selected solvers. Finally, the applica- tions of WPMax-SAT in real-life.

Issued also as CD

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image