Constraint programming and graph algorithms

Michel Gangnet, Burton Rosenberg

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

A constraint system includes a set of variables and a set of relations among these variables, called constraints. The solution of a constraint system is an assignment of values to variables so that all, or many, of the relations are made true. A simple and efficient method for constraint resolution has been proposed in the work of B.N. Freeman-Benson, J. Maloney, and A. Borning. We show how their method is related to the classical problem of graph matching, and from this connection we derive new resolution algorithms.

Original languageEnglish (US)
Pages (from-to)271-284
Number of pages14
JournalAnnals of Mathematics and Artificial Intelligence
Volume8
Issue number3-4
DOIs
StatePublished - Sep 1 1993

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Constraint programming and graph algorithms'. Together they form a unique fingerprint.

  • Cite this