DDCSP: Constraint Satisfaction Problem Used for Rule-Based System

Abstract

We present here an approach for solving rule based system with constraint satisfaction model. There exist but a few trials to model expert systems with constraint satisfaction problems. However, the CSP basic paradigm is not powerful enough to capture or to take advantage of essential aspects of rule based systems, such as the a priori unknown number of constituent parts of a system or the inherent internal structure of these parts. Although notable efforts have been spent on extending the basic paradigm to accommodate these issues, we still lack a comprehensive CSP formalism of rule based system. This paper presents the main ideas behind a general constraint model of rule based system represented as a new class of non standard constraint satisfaction problems called DDCSP (Dynamic Domain Constraint Satisfaction Problem). DDCSP unify several CSP extensions, providing a more comprehensive and efficient framework for rule based reasoning.