Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih

In the past seven decades, Constraint Satisfaction (CS) has been extensively studied and remarkably evolved to where the scientific community perceives it as the centre of the intelligent behaviour. Therefore, most of the recent research in the field is devoted to improving the problem solvers that...

Full description

Saved in:

Bibliographic Details
Main Author:	Ahmed Abuluaih, Saajid Akram
Format:	Thesis
Language:	English
Published:	2019
Subjects:	Algorithms Data mining
Online Access:	https://ir.uitm.edu.my/id/eprint/82956/1/82956.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uitm-ir.82956
record_format	uketd_dc
spelling	my-uitm-ir.829562024-02-07T01:38:36Z Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih 2019 Ahmed Abuluaih, Saajid Akram Algorithms Data mining In the past seven decades, Constraint Satisfaction (CS) has been extensively studied and remarkably evolved to where the scientific community perceives it as the centre of the intelligent behaviour. Therefore, most of the recent research in the field is devoted to improving the problem solvers that utilize search strategies and techniques. Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. Moreover, since the establishment of the field, AI pioneers and specialists have setup instructions and guidelines on how to solve this type of problems back in the seventies of the last century and have not been changed or improved. For example, the framework of solving CSP imposes a complete permutation of assignments to all remaining variables in order to derive a valid model. The author argues in this study that the problem can be neutralised and it is not necessary to perform brute-force searching all the time if a search strategy could have guided the process to the level where the values of the remaining variables can be determined implicitly, creating what the author calls Solo-Path of assignments in the problem search tree. 2019 Thesis https://ir.uitm.edu.my/id/eprint/82956/ https://ir.uitm.edu.my/id/eprint/82956/1/82956.pdf text en public phd doctoral Universiti Teknologi MARA (UiTM) Faculty of Computer and Mathematical Sciences Mohamed, Azlinah
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Mohamed, Azlinah
topic	Algorithms Data mining
spellingShingle	Algorithms Data mining Ahmed Abuluaih, Saajid Akram Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
description	In the past seven decades, Constraint Satisfaction (CS) has been extensively studied and remarkably evolved to where the scientific community perceives it as the centre of the intelligent behaviour. Therefore, most of the recent research in the field is devoted to improving the problem solvers that utilize search strategies and techniques. Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. Moreover, since the establishment of the field, AI pioneers and specialists have setup instructions and guidelines on how to solve this type of problems back in the seventies of the last century and have not been changed or improved. For example, the framework of solving CSP imposes a complete permutation of assignments to all remaining variables in order to derive a valid model. The author argues in this study that the problem can be neutralised and it is not necessary to perform brute-force searching all the time if a search strategy could have guided the process to the level where the values of the remaining variables can be determined implicitly, creating what the author calls Solo-Path of assignments in the problem search tree.
format	Thesis
qualification_name	Doctor of Philosophy (PhD.)
qualification_level	Doctorate
author	Ahmed Abuluaih, Saajid Akram
author_facet	Ahmed Abuluaih, Saajid Akram
author_sort	Ahmed Abuluaih, Saajid Akram
title	Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
title_short	Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
title_full	Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
title_fullStr	Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
title_full_unstemmed	Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
title_sort	neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / saajid akram ahmed abuluaih
granting_institution	Universiti Teknologi MARA (UiTM)
granting_department	Faculty of Computer and Mathematical Sciences
publishDate	2019
url	https://ir.uitm.edu.my/id/eprint/82956/1/82956.pdf
_version_	1794191956483506176

Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih

Similar Items