Labeling and Partial Local Consistency for Soft Constraint Programming. Bistarelli, S., Philippe, C., Yan, G., & Francesca, R. 2000.
doi  abstract   bibtex   
In this paper we generalize to soft constraints the approximation techniques usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the experimental results ton partial are-consistency) show that this work can help develop more efficient implementations for logic-based languages working with soft constraints.
@conference{
	11391_142634,
	author = {Bistarelli, Stefano and Philippe, Codognet and Yan, Georget and Francesca, Rossi},
	title = {Labeling and Partial Local Consistency for Soft Constraint Programming},
	year = {2000},
	publisher = {SPRINGER-VERLAG},
	volume = {1753},
	booktitle = {PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES},
	abstract = {In this paper we generalize to soft constraints the approximation techniques usually used for local consistency in classical constraint satisfaction and programming. The theoretical results show that this is indeed possible without loosing the fundamental properties of such techniques, and the experimental results ton partial are-consistency) show that this work can help develop more efficient implementations for logic-based languages working with soft constraints.},
	doi = {10.1007/3-540-46584-7_16},	
	pages = {230--248}
}

Downloads: 0