Reason maintenance in constraint satisfaction

Research effort in constraint satisfaction has traditionally been devoted to curbing the exponential cost of search through the methods of backtracking and problem reduction. These methods serve the overall goal of avoiding redundant computations and reduce the search space needed to derive a soluti...

Full description

Saved in:
Bibliographic Details
Main Author: Tay, Joc Cing.
Other Authors: School of Computer Engineering
Format: Theses and Dissertations
Language:English
Published: 2008
Subjects:
Online Access:http://hdl.handle.net/10356/13598
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-13598
record_format dspace
spelling sg-ntu-dr.10356-135982023-03-04T00:29:15Z Reason maintenance in constraint satisfaction Tay, Joc Cing. School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence Research effort in constraint satisfaction has traditionally been devoted to curbing the exponential cost of search through the methods of backtracking and problem reduction. These methods serve the overall goal of avoiding redundant computations and reduce the search space needed to derive a solution. The advent of reason maintenance systems (or RMSs) in recent years have provided the necessary machinery to dynamically determine the causes of failure, revise assumptions and avoid redundancy in backtracking. In addition, RMS-based CSP solvers promote program design clarity by separating control and inference mechanisms. However, it is well known that classical breadth-first control of the RMS incurs an exponential amount of work when only a few solutions are required. Furthermore, research effort in reason maintenance technology has neither consolidated nor clearly defined a direction for improving its performance. The deployment of such an RMS-based solver for CSPs is also a topic that has only been theoretically evaluated against classical constraint satisfaction techniques. Their derived similarities on a propositional level have promoted the inter-migration of solutions and ideas from both fields, but an evaluation of their empirical performance and comparison of respective problem solving models remains an area that has shown little growth. Doctor of Philosophy (SCE) 2008-10-20T09:58:08Z 2008-10-20T09:58:08Z 1999 1999 Thesis http://hdl.handle.net/10356/13598 en 295 p. application/pdf application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
spellingShingle DRNTU::Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Tay, Joc Cing.
Reason maintenance in constraint satisfaction
description Research effort in constraint satisfaction has traditionally been devoted to curbing the exponential cost of search through the methods of backtracking and problem reduction. These methods serve the overall goal of avoiding redundant computations and reduce the search space needed to derive a solution. The advent of reason maintenance systems (or RMSs) in recent years have provided the necessary machinery to dynamically determine the causes of failure, revise assumptions and avoid redundancy in backtracking. In addition, RMS-based CSP solvers promote program design clarity by separating control and inference mechanisms. However, it is well known that classical breadth-first control of the RMS incurs an exponential amount of work when only a few solutions are required. Furthermore, research effort in reason maintenance technology has neither consolidated nor clearly defined a direction for improving its performance. The deployment of such an RMS-based solver for CSPs is also a topic that has only been theoretically evaluated against classical constraint satisfaction techniques. Their derived similarities on a propositional level have promoted the inter-migration of solutions and ideas from both fields, but an evaluation of their empirical performance and comparison of respective problem solving models remains an area that has shown little growth.
author2 School of Computer Engineering
author_facet School of Computer Engineering
Tay, Joc Cing.
format Theses and Dissertations
author Tay, Joc Cing.
author_sort Tay, Joc Cing.
title Reason maintenance in constraint satisfaction
title_short Reason maintenance in constraint satisfaction
title_full Reason maintenance in constraint satisfaction
title_fullStr Reason maintenance in constraint satisfaction
title_full_unstemmed Reason maintenance in constraint satisfaction
title_sort reason maintenance in constraint satisfaction
publishDate 2008
url http://hdl.handle.net/10356/13598
_version_ 1759854543335587840