Constraint programming and graph algorithms

Michel Gangnet; Burton Rosenberg

doi:10.1007/BF01530793

Constraint programming and graph algorithms

Michel Gangnet, Burton Rosenberg

Computer Science

Research output: Contribution to journal › Article

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 language	English (US)
Pages (from-to)	271-284
Number of pages	14
Journal	Annals of Mathematics and Artificial Intelligence
Volume	8
Issue number	3-4
DOIs	https://doi.org/10.1007/BF01530793
State	Published - Sep 1 1993

ASJC Scopus subject areas

Artificial Intelligence
Applied Mathematics

Access to Document

10.1007/BF01530793

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

Cite this

Gangnet, M., & Rosenberg, B. (1993). Constraint programming and graph algorithms. Annals of Mathematics and Artificial Intelligence, 8(3-4), 271-284. https://doi.org/10.1007/BF01530793

@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 Burton Rosenberg",

year = "1993",

month = sep,

day = "1",

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

PY - 1993/9/1

Y1 - 1993/9/1

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

AN - SCOPUS:21344482094

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 -