Solving binary CSP using computational systems

Abstract In this paper we formalise CSP solving as an inference process. Based on the notion of Computational Systems we associate actions with rewriting rules and control with strategies that establish the order of application of the inferences. The main contribution of this work is to lead the way to the design of a formalism allowing to better understand constraint solving and to apply in the domain of CSP the knowledge already developed in Automated Deduction.

[1]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[2]  Ho-fung Leung,et al.  Incremental querying in the concurrent CLP language IFD-Constraint Pandora , 1996, SAC '96.

[3]  Robert R. Karfhage.  Logic for the computer sciences , 1964, CACM.

[4]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[5]  C. Bessiere,et al.  An arc-consistency algorithm optimal in the number of constraint checks , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.

[6]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[7]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[8]  Richard Fikes,et al.  REF-ARF: A System for Solving Problems Stated as Procedures , 1970, Artif. Intell..

[9]  Pascal Van Hentenryck,et al.  Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.

[10]  Richard J. Wallace,et al.  Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs , 1993, IJCAI.

[11]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[12]  Christian Bessière,et al.  1 A fast algorithm to establish arc-consistency in constraint networks , 1994 .

[13]  Daniel G. Bobrow,et al.  New Programming Languages for Artificial Intelligence Research , 1974, CSUR.

[14]  Patrick Henry Winston,et al.  The psychology of computer vision , 1976, Pattern Recognit..

[15]  Pascal Van Hentenryck.  Constraint Programming Languages , 1993, ICTAI.

[16]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[17]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[18]  Hélène Kirchner,et al.  On the Use of Constraints in Automated Deduction , 1994, Constraint Programming.

[19]  Vipin Kumar,et al.  Search in Artificial Intelligence , 1988, Symbolic Computation.

[20]  Bernard A. Nadel,et al.  Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .

[21]  Mark W. Perlin,et al.  Arc consistency for factorable relations , 1991, [Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91.

[22]  Pascal Van Hentenryck,et al.  An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.

[23]  B. F. Caviness.  On Canonical Forms and Simplification , 1970, JACM.

[24]  Walter Hower,et al.  Backtracking along with constraint processing and their time complexities , 1996, J. Exp. Theor. Artif. Intell..

[25]  José Meseguer,et al.  Conditioned Rewriting Logic as a United Model of Concurrency , 1992, Theor. Comput. Sci..

[26]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[27]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[28]  William Leler,et al.  Constraint programming languages: their specification and generation , 1988 .

[29]  Eugene C. Freuder.  Using Metalevel Constraint Knowledge to Reduce Constraint Checking , 1995, Constraint Processing, Selected Papers.

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