Constraint programming and graph algorithms

Michel Gangnet, Burton J Rosenberg

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 1993

Fingerprint

Graph Algorithms
Constraint Programming
Graph Matching
Assignment

ASJC Scopus subject areas

  • Applied Mathematics
  • Artificial Intelligence

Cite this

Constraint programming and graph algorithms. / Gangnet, Michel; Rosenberg, Burton J.

In: Annals of Mathematics and Artificial Intelligence, Vol. 8, No. 3-4, 09.1993, p. 271-284.

Research output: Contribution to journalArticle

@article{6d5d4d1336764171a283e3fcc20b2990,
title = "Constraint programming and graph algorithms",
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.",
author = "Michel Gangnet and Rosenberg, {Burton J}",
year = "1993",
month = "9",
doi = "10.1007/BF01530793",
language = "English (US)",
volume = "8",
pages = "271--284",
journal = "Annals of Mathematics and Artificial Intelligence",
issn = "1012-2443",
publisher = "Springer Netherlands",
number = "3-4",

}

TY - JOUR

T1 - Constraint programming and graph algorithms

AU - Gangnet, Michel

AU - Rosenberg, Burton J

PY - 1993/9

Y1 - 1993/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=21344482094&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21344482094&partnerID=8YFLogxK

U2 - 10.1007/BF01530793

DO - 10.1007/BF01530793

M3 - Article

VL - 8

SP - 271

EP - 284

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 3-4

ER -