Implementation of Strategies for Solving Constraint Satisfaction Problems

DSpace Home
→
08 Faculty of Arts and Sciences
→
Department of Mathematics
→
Theses (Master's and Ph.D) – Mathematics
→
View Item

dc.contributor.advisor	Aliyev, Rashad
dc.contributor.author	Hasan, Zewar Fadhlulddin
dc.date.accessioned	2016-09-30T07:47:45Z
dc.date.available	2016-09-30T07:47:45Z
dc.date.issued	2015-07
dc.date.submitted	2015
dc.identifier.citation	Hasan, Zewar Fadhlulddin. (2015). Implementation of Strategies for Solving Constraint Satisfaction Problems. Thesis (M.S.), Eastern Mediterranean University, Institute of Graduate Studies and Research, Dept. of Mathematics, Famagusta: North Cyprus.	en_US
dc.identifier.uri	http://hdl.handle.net/11129/2921
dc.description	Master of Science in Applied Mathematics and Computer Science. Thesis (M.S.)--Eastern Mediterranean University, Faculty of Arts and Sciences, Dept. of Mathematics, 2015. Supervisor: Prof. Dr. Rashad Aliyev.	en_US
dc.description.abstract	This thesis investigates the different strategies for solving constraint satisfaction problems. The basic properties of constraint satisfaction problems are discussed. The different types of constraints are given. The constraint graph and cryptarithmetic constraint satisfaction problems are discussed. Such search techniques as backtracking search, local search, and constraint propagation for solving constraint satisfaction problems are presented. The forward checking in constraint satisfaction problems is used. Some constraint satisfaction problems such as map-coloring problem, cryptarithmetic problem, n-queens problems and Sudoku problem are solved. Keywords: Constraint satisfaction problem, Constraint graph, Backtracking search, n-queens problem, Local search, Constraint propagation, Forward checking	en_US
dc.description.abstract	ÖZ: Bu tez kısıtlama memnuniyeti sorunlarını çözmek için farklı stratejiler araştırıyor. Ayrıca, kısıtlama memnuniyeti problemlerinin temel özellikleri tartışılır. Bunun yanında, kısıtlamaların farklı türleri verilmiştir. Kısıtlama grafiği ve cryptarithmetic kısıtlama memnuniyeti sorunları tartışılır. Geriye arama, yerel arama ve kısıtlama memnuniyeti problemlerinin çözümü için kısıtlama yayılma gibi arama teknikleri sunulmuştur. Kısıtlama memnuniyeti problemlerinde ileri kontrol yöntemi kullanılır. Harita renklendirme problemi, cryptarithmetic problemi, n-vezir problemi gibi bazı kısıtlama memnuniyeti problemleri ve Sudoku problemi çözülür. Anahtar Kelimeler: Kısıtlama memnuniyeti sorunu, Kısıtlama grafiki, Geri İzleme arama, n-vezir problemi, Yerel arama, Kısıtlama yayılımı, İleri kontrol	en_US
dc.language.iso	eng	en_US
dc.publisher	Eastern Mediterranean University (EMU) - Doğu Akdeniz Üniversitesi (DAÜ)	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.subject	Mathematics	en_US
dc.subject	Applied Mathematics and Computer Science	en_US
dc.subject	Constraint programming (Computer science)	en_US
dc.subject	Constraint satisfaction problem	en_US
dc.subject	Constraint graph	en_US
dc.subject	Backtracking search	en_US
dc.subject	n-queens problem	en_US
dc.subject	Local search	en_US
dc.subject	Constraint propagation	en_US
dc.subject	Forward checking	en_US
dc.title	Implementation of Strategies for Solving Constraint Satisfaction Problems	en_US
dc.type	masterThesis	en_US
dc.contributor.department	Eastern Mediterranean University, Faculty of Arts and Science, Department of Mathematics	en_US