000			02164cam a2200337 a 4500
003			EG-GiCUC
005			20250223031407.0
008			160112s2015 ua d f m 000 0 eng d
040			_aEG-GiCUC _beng _cEG-GiCUC
041	0		_aeng
049			_aDeposite
097			_aM.Sc
099			_aCai01.12.17.M.Sc.2015.Mo.O
100	0		_aMohamed Hesham Mohamed Emam Elhalaby
245	1	0	_aOn the weighted partial maximum satis ability problem / _cMohamed Hesham Mohamed Emam Elhalaby ; Supervised L. F. Abdelal , Rasha Mohamed Shaheen
246	1	5	_aدراسة بعض حالات مسألة التحقق الجزئي للصيغة البولياوية ذات الوزن الاكبر
260			_aCairo : _bMohamed Hesham Mohamed Emam Elhalaby , _c2015
300			_a195 P. : _bcharts ; _c25cm
502			_aThesis (M.Sc.) - Cairo University - Faculty of Science - Department of Mathematics
520			_aThis 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.
530			_aIssued also as CD
653		4	_aBoolean formula
653		4	_aComputational complexity
653		4	_aSatisfiability
700	0		_aLaila Fafmy Abdelal , _eSupervisor
700	0		_aRasha Mohamed Shaheen , _eSupervisor
856			_uhttp://172.23.153.220/th.pdf
905			_aNazla _eRevisor
905			_aSoheir _eCataloger
942			_2ddc _cTH
999			_c54413 _d54413