Partial Constraint Satisfaction

Partial Constraint Satisfaction (1992)

Cached

Download Links

[4c.ucc.ie]
[www.sci.unich.it]

Other Repositories/Bibliography

DBLP

by Eugene C. Freuder , Richard J. Wallace

Citations:

390 - 22 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Partial Constraint Satisfaction	user correction - Legacy Corrections
AUTHOR NAME	Eugene C. Freuder	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department	SVM HeaderParse 0.2
AUTHOR ADDR	Kingsbury Hall, University of New Hampshire,; Durham, NH 03824, USA	SVM HeaderParse 0.1
AUTHOR NAME	Richard J. Wallace	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science Department	SVM HeaderParse 0.2
AUTHOR ADDR	Kingsbury Hall, University of New Hampshire,; Durham, NH 03824, USA	SVM HeaderParse 0.1
ABSTRACT	. A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem, in particular by satisfying a maximal number of constraints. Standard backtracking and local consistency techniques for solving constraint satisfaction problems can be adapted to cope with, and take advantage of, the differences between partial and complete constraint satisfaction. Extensive experimentation on maximal satisfaction problems illuminates the relative and absolute effectiveness of these methods. A general model of partial constraint satisfaction is proposed. 1 Introduction Constraint satisfaction involves finding values for problem variables subject to constraints on acceptable combinations of values. Constraint satisfaction has wide application in artificial intelligence, in areas ranging from temporal r...	user correction - Legacy Corrections
YEAR	1992	user correction - Legacy Corrections
CITATIONS	37 found	ParsCit 1.0