登入選單

返回Google圖書搜尋

Committing to User Choices in Mixed Initiative CSPs

Simon Fraser University. Centre for Systems ScienceW. Ken Jackson

出版	Simon Fraser University, Centre for Systems Science, 1995
URL	http://books.google.com.hk/books?id=ubapHwAACAAJ&hl=&source=gbs_api

註釋

In a mixed initiative system for solving a constraint satisfaction problem (CSP), both the user and the system make choices in trying to find a solution. These choices typically involve deciding what values to assign to variables. A desirable property in mixed initiative systems is that they commit to user choices: the user assignments should be retained as long as there is a complete solution containing those assignments. This paper shows that several backtracking algorithms, typically used to solve constraint satisfaction problems, do not commit to user choices. The main contribution of the paper is to show why this occurs and also to present an algorithm that does commit to user choices. This algorithm is a slight modification of the backtracking algorithm of Ginsberg (1993).