Please use this identifier to cite or link to this item:
Title: Exploring Alternative Restoration Techniques in Constraint Programming
Authors: LIN YONG
Keywords: constraint programming, constraint programming systems, memory management, state restoration, combinatorial search, implementation
Issue Date: 24-Jan-2014
Source: LIN YONG (2014-01-24). Exploring Alternative Restoration Techniques in Constraint Programming. ScholarBank@NUS Repository.
Abstract: Constraint programming is a powerful tool for solving combinatorial problems, and constraint programming systems provide the facilities to support this tool. In such a system, search defines the strategies to explore solutions, and restoration recovers from an inconsistency to a previously visited state. Hence, a state-of-the-art restoration is essential for an efficient constraint programming system. In this thesis, we investigate two alternative restoration techniques for building constraint programming systems. The first is to maintain the variables that were affected by propagation to reach fix points. It neither rolls back performed operations as trailing does nor repeats computation work as recomputation does, while consuming much less memory than copying. Subsequently, we explore programming restoration granularity, which aims at providing facilities for users to customize restoration, and describe a prototype implementation. Finally, we propose the use of the aspect-oriented programming paradigm to achieve a more extensible and modular system.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
LIN Yong.pdf566.13 kBAdobe PDF



Page view(s)

checked on Dec 11, 2017


checked on Dec 11, 2017

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.