Skip to main content
Conference Proceedings

SOGgy constraints: Soft open global constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5732 LNCS 584-591
DOI: 10.1007/978-3-642-04244-7_46
9Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes of decomposition-based and edit-based soft constraints to be contractible. Finally, we outline a propagator for an open generalized edit-based soft Regular constraint. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Maher, M. J. (2009). SOGgy constraints: Soft open global constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5732 LNCS, pp. 584–591). https://doi.org/10.1007/978-3-642-04244-7_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free