Document Details

Document Type : Thesis 
Document Title :
SOME EXTENSIONS OF BOOLEAN SATISFIABILITY WITH APPLICATIONS
بعض التوسيعات في المشبعية البولانية مع تطبيقاتها
 
Subject : Faculty of Engineering 
Document Language : Arabic 
Abstract : Boolean Satisfiability can be defined as a search problem where one searches for a solution that can meet some specific requirements. There is no absolute way to find such a solution by a specific method but an intelligent way is required for finding a particular solution among the set of all possible solutions in the search space. The efficiency of a satisfiability algorithm is measured by how much reduction is achieved in the part of the search space traversed to find the solution. Pre-processing reasoning and intermediate reasoning significantly simplify the problem. The automated or computerized solvers which are used to solve the satisfiability problem are called SAT Solvers. This dissertation will study the SAT Solvers along with the pre-processing techniques which are used to enhance the performance of SAT-Solver. The dissertation will also study how the problem of Boolean Satisfiability can be solved analytically through the solution of Boolean Equations. The main contribution of this dissertation is to extend the classical crisp two-valued Boolean Satisfiability problem to the domains of (a) Big Boolean algebras, and (b) to explore possible applications. 
Supervisor : Prof. Ali Rushdi 
Thesis Type : Doctorate Thesis 
Publishing Year : 1439 AH
2017 AD 
Added Date : Wednesday, December 6, 2017 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
وليد احمدAhmad, Waleed ResearcherDoctorate 

Files

File NameTypeDescription
 42931.pdf pdf 

Back To Researches Page