A truth maintenance system for supporting constraint-based reasoning

Abstract Many types of choice problems that arise in design, be it architectural/engineering design or the design of economic models, can be formulated as constraint satisfaction problems (CSPs). In general, TMSs are a useful computational mechanism for maintaining consistent beliefs or assumptions in problems characterized by a set of constraints. They also enable a problem solver to explore a search space more efficiently by recording the causes of failed partial solutions, and provide a limited explanation capability since reasons for beliefs are recorded explicitly. In this paper we describe a Truth Maintenance System (TMS) whose architecture has been motivated by the structure of a commonly occurring type of CSP. We show that by exploiting structural features of dependency constraints involved in CSPs and adopting a certain delineation of responsibilities between the TMS and a problem solver, considerable simplicity in the TMS architecture and efficiency in its status assignment algorithms is achieved. We also compare how reasoning systems designed for solving constraint satisfaction problems using our specialized TMS differ from those using other truth maintenance models such as McAllester's RUP and de Kleer's ATMS.

[1]  David A. McAllester.  An Outlook on Truth Maintenance. , 1980 .

[2]  Rina Dechter,et al.  Network-based heuristics for constraint satisfaction problems , 1988 .

[3]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[4]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[5]  Vasant Dhar,et al.  Experiments with an Integer Programming Formulation of an Expert System , 1989 .

[6]  Vasant Dhar,et al.  Knowledge-based decision support in business: Issues and a solution , 1988, IEEE Expert.

[7]  Gerald Jay Sussman,et al.  Propagation of constraints applied to circuit synthesis , 1980 .

[8]  John N. Hooker,et al.  A quantitative approach to logical inference , 1988, Decis. Support Syst..

[9]  Geoffrey E. Hinton.  Relaxation and its role in vision , 1977 .

[10]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[11]  R M Haralick,et al.  The consistent labeling problem: part I. , 1979, IEEE transactions on pattern analysis and machine intelligence.

[12]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[13]  Vasant Dhar,et al.  Rule-based versus structure-based models for explaining and generating expert behavior , 1987, CACM.

[14]  Charles J. Petrie,et al.  Revised Dependencydirected Backtracking for Default Reasoning , 1987, AAAI.

[15]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[16]  D. Knuth.  Estimating the efficiency of backtrack programs. , 1974 .

[17]  Johan de Kleer,et al.  Problem Solving with the ATMS , 1986, Artif. Intell..

[18]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[19]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..