Fuzzy Satisfiability Problems and Applications / (Record no. 166784)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05462namaa22004211i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - أخر تعامل مع التسجيلة | |
| control field | 20250223033237.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240423s2022 |||a|||fr|m|| 000 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloguing agency | EG-GICUC |
| Language of cataloging | eng |
| Transcribing agency | EG-GICUC |
| Modifying agency | EG-GICUC |
| Description conventions | rda |
| 041 0# - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| Language code of summary or abstract | eng |
| Language code of sung or spoken text | ara |
| 049 ## - Acquisition Source | |
| Acquisition Source | Deposit |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.3 |
| 092 ## - LOCALLY ASSIGNED DEWEY CALL NUMBER (OCLC) | |
| Classification number | 511.3 |
| Edition number | 21 |
| 097 ## - Degree | |
| Degree | Ph.D |
| 099 ## - LOCAL FREE-TEXT CALL NUMBER (OCLC) | |
| Local Call Number | Cai01.12.17.Ph.D.2022.Mo.F |
| 100 0# - MAIN ENTRY--PERSONAL NAME | |
| Authority record control number or standard number | Mohamed Hesham Mohamed Emam El Halaby, |
| Preparation | preparation. |
| 245 10 - TITLE STATEMENT | |
| Title | Fuzzy Satisfiability Problems and Applications / |
| Statement of responsibility, etc. | Presented by Mohamed Hesham Mohamed Emam El Halaby ; Supervisors Prof. Dr. Laila Abd Elal, Dr. Areeg Abdalla |
| 246 15 - VARYING FORM OF TITLE | |
| Title proper/short title | مسائل التحقق في المنطق الضبابي وتطبيقاتهم / |
| 264 #0 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Date of production, publication, distribution, manufacture, or copyright notice | 2022. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 102 pages : |
| Other physical details | illustrations ; |
| Dimensions | 25 cm. + |
| Accompanying material | CD. |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Source | rda content |
| 337 ## - MEDIA TYPE | |
| Media type term | Unmediated |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | volume |
| Source | rdacarrier |
| 502 ## - DISSERTATION NOTE | |
| Dissertation note | Thesis (Ph.D)-Cairo University, 2022. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Bibliography: pages 86-102. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | The Satisfiability problem (SAT) is deciding whether the given CNF<br/>formula has a satisfying assignment or not. SAT is one of the most<br/>studied problems in computer science for its importance from both a<br/>theoretical and practical perspectives. The Maximum Satisfiability<br/>problem (MaxSAT) is finding an assignment that maximizes the<br/>number of satisfied clauses in the given CNF formula. Both SAT and<br/>MaxSAT have received less attention in non-classical logics, such as<br/>fuzzy logics and the objective of this thesis is to fill in the gap.<br/>The major contributions of this thesis are as follows. Firstly, we<br/>show that MaxSAT is N P-complete for Ł-clausal forms.<br/>Secondly, we provide an instance generation model that is used to<br/>produce Ł-clausal forms with different values of k and degree of absence<br/>of negated terms ¬(l1 ⊕ · · · ⊕ lm) in each clause.<br/>Thirdly, we conduct an empirical investigation to identify the<br/>relationship between the cost and other parameters of the instance<br/>generator. Using our generation model, we can construct instances<br/>with different costs but having the same clauses-to-variables ratio.<br/>Fourthly, we investigate the prediction the satisfiability of Ł-clausal<br/>forms by training different classifiers (Neural Network, Linear SVC,<br/>Logistic Regression, Random Forest and Decision Tree). We used our<br/>instance generator to construct 3-valued and 7-valued Ł-clausal forms<br/>in the phase transition area from which we extract numeric and graph<br/>features. Using a neural network classifier, we obtained a mean cross-<br/>validation score of 95.2%.<br/>Finally, we present a new application to SAT that involves encoding<br/>the k-coloring problem as a propositional formula in Łukasiewicz<br/>logic with k truth values then solving its satisfiability with SMT<br/>technology. The new encoding is more intuitive and compact than its<br/>basic counterpart in Boolean logic. Through experimental results, we<br/>show that our new technique is superior than its Boolean counterpart<br/>in performance specially on unsatisfiable instances |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | مسألة التحقق (SAT) هي تقرير ما اذا كان يوجد حل يحقق الصيغة البوليانية المعطاه. هذه المسألة هي واحدة من أكثر المسائل محل الدراسة في علوم الحاسب نظرا لأهميتها من الناحية النظرية و العملية. مسألة أقصى تحقق ممكن (MaxSAT) هي إيجاد الحل الذي يحقق أكبر عدد من الجمل المكونة للصيغة المعطاه. لم تلقى كلاً من SAT و MaxSAT اهتماماً كافياً في المنطق الضبابي. الهدف من هذه الأطروحة هو مناقشة SAT و MaxSAT في المنطق الضبابي، وعلى وجه الخصوص، الصيغ الإقتراحية في منطق Łukasiewicz. وتقدم الرسالة اثبات أن التعقيد الحسابي لـ MaxSAT من نوع NP-complete. ثم نقدم نموذج مولد الصيغ يُستخدم لإنتاج الصيغ الاقتراحية لأشكال Ł-clausal بقيم مختلفة لـ k ودرجة غياب المصطلحات (الاطراف) المنفية (l1⊕•••⊕ lm)¬ في كل جملة. ايضاً نقوم بدراسة تجريبيه للعلاقة بين معامل التكلفة و المعاملات الأخرى لمولد الصيغ. ثم ندرس ملاءمة أشكال Ł-clausal من خلال تدريب نماذح مختلفة لتعليم الاله وحصلنا على متوسط درجة تحقق متقاطع 95.2٪ وأخيراً، نقدم تطبيقاً جديدًا لـ SAT و الذى يتضمن ترميز مسألة k-coloring كصيغة مقترحة في منطق Łukasiewicz لـ k قيمة ثم تقديم حل أكثر سهولة وصغراً من نظيره الأساسي في المنطق البوليانى. |
| 530 ## - ADDITIONAL PHYSICAL FORM AVAILABLE NOTE | |
| Issues CD | Issued also as CD |
| 546 ## - LANGUAGE NOTE | |
| Text Language | Text in English and abstract in Arabic & English. |
| 650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Mathematics |
| Source of heading or term | qrmark |
| 653 #0 - INDEX TERM--UNCONTROLLED | |
| Uncontrolled term | SAT |
| -- | Ł-clausal forms |
| -- | Łukasiewicz logic |
| -- | MaxSAT |
| -- | Machine learning |
| 700 0# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Laila Abd Elal |
| Relator term | thesis advisor. |
| 700 0# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Areeg Abdalla |
| Relator term | thesis advisor. |
| 900 ## - Thesis Information | |
| Grant date | 01-01-2022 |
| Supervisory body | Laila Abd Elal |
| -- | Areeg Abdalla |
| Universities | Cairo University |
| Faculties | Faculty of Science |
| Department | Department of Mathematics |
| 905 ## - Cataloger and Reviser Names | |
| Cataloger Name | Eman Ghareeb |
| Reviser Names | Huda |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Thesis |
| Edition | 21 |
| Suppress in OPAC | No |
| Source of classification or shelving scheme | Home library | Current library | Date acquired | Inventory number | Full call number | Barcode | Date last seen | Effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | المكتبة المركزبة الجديدة - جامعة القاهرة | قاعة الرسائل الجامعية - الدور الاول | 23.04.2024 | 88253 | Cai01.12.17.Ph.D.2022.Mo.F | 01010110088253000 | 23.04.2024 | 23.04.2024 | Thesis |