Back to results

University of New Hampshire

Towards more efficient solution of conditional constraint satisfaction problems

Abstract

dc:description.abstract

<p>The focus of the thesis is on improving solving constraint satisfaction problems (CSPs) that change with certain conditions. This special class of problems, which we call conditional CSPs, has proved very useful in modeling important applications, such product configuration and design, and distributed software diagnosis and network management. The problem conditions model choices customers make to configure a product, or they are installation settings or actual observations of a running system that is monitored for diagnosis purpose.</p><p>The key, novel contribution of this thesis are two approaches for improving solving methods and the use of random conditional CSPs to evaluate the performance of these methods. With the first approach we propose new algorithms for solving conditional CSPs. These algorithms propagate problem constraints and conditions. The second approach explores the feasibility of reformulating the problem into a standard CSP and introduces new reformulation algorithms.</p><p>The implementation results have been evaluated experimentally. The experimental design has extensive test suites of randomly generated standard and conditional CSPs for which general problem parameters, such as density and satisfiability, were varied, as well as specialized parameters that characterize the representation of problem conditions.</p><p>The significance of the work lies in the advance of problem resolution for the class of conditional CSPs and the experimental analysis for the proposed new algorithms. The limited solving developments known in the literature of the class of conditional CSPs, a backtrack search algorithm tested on a handful of small problem examples, have been taken an important step further and aligned with efforts reported for standard and other special classes of CSPs.</p>

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy
Level thesis:degree_level
Dissertation
Year
2003

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sabin, Mihaela
Contributors dc:contributor
  • Eugene Freuder

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholars.unh.edu/dissertation/133
OAI identifier oai:identifier
oai:scholars.unh.edu:dissertation-1132

Chain of custody

source
Harvested from
University of New Hampshire
Base URL
scholars.unh.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Sabin, Mihaela. Towards more efficient solution of conditional constraint satisfaction problems. Dissertation thesis, 2003. https://scholars.unh.edu/dissertation/133