Interval-valued soft constraint problems

Simple item page
dc.contributor.authorGelain, Mirco
dc.contributor.authorPini, Maria Silvia
dc.contributor.authorRossi, Francesca
dc.contributor.authorVenable, Kristin Brent
dc.contributor.authorWilson, Nic
dc.contributor.funderScience Foundation Irelanden
dc.contributor.funderMinistero dell’Istruzione, dell’Università e della Ricerca, Italyit
dc.date.accessioned2013-04-30T16:43:24Z
dc.date.available2013-04-30T16:43:24Z
dc.date.copyright2010
dc.date.issued2010-04
dc.date.updated2012-12-20T17:27:48Z
dc.description.abstractConstraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference values, and it is much more reasonable to allow for preference intervals. We define several notions of optimal solutions for such problems, providing algorithms to find optimal solutions and also to test whether a solution is optimal. Most of the time these algorithms just require the solution of soft constraint prob- lems, which suggests that it may be possible to handle this form of uncertainty in soft constraints without significantly increasing the computational effort needed to reason with such problems. This is supported also by experimental results. We also identify classes of problems where the same results hold if users are allowed to use multiple disjoint intervals rather than a single one.en
dc.description.sponsorshipScience Foundation Ireland (05/IN/I886); Science Foundation Ireland (08/PI/I1912); Ministero dell’Istruzione, dell’Università e della Ricerca, Italy (PRIN project 20089M932N)en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationGelain, M; Pini, MS; Rossi, F; Venable, KB; Wilson, N; (2010) 'Interval-valued Soft Constraint Problems'. Annals of Mathematics and Artificial Intelligence, 58 (3/4): 261–298. doi: 10.1007/s10472-010-9203-0en
dc.identifier.doi10.1007/s10472-010-9203-0
dc.identifier.endpage298en
dc.identifier.issn1573-7470
dc.identifier.issued3/4en
dc.identifier.journaltitleAnnals of Mathematics and Artificial Intelligenceen
dc.identifier.startpage261en
dc.identifier.urihttps://hdl.handle.net/10468/1104
dc.identifier.volume58en
dc.language.isoenen
dc.publisherSpringer-Verlagen
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Technology and Innovation Development Award (TIDA)/05/IN.1/I886 TIDA 09/IE/Costraint Baset Energy Cost Efficient Scheduling/
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/08/IN.1/I1912/IE/The Development of Artificial intelligence Approaches for Preferences in Combinational Problems/
dc.relation.urihttp://link.springer.com/article/10.1007%2Fs10472-010-9203-0
dc.rights© Springer Science+Business Media B.V. 2010. The final publication is available at http://link.springer.com/article/10.1007%2Fs10472-010-9203-0en
dc.subjectSoft constraintsen
dc.subjectPreferencesen
dc.subjectInterval reasoningen
dc.subjectUncertaintyen
dc.subject.lcshComputer science.en
dc.titleInterval-valued soft constraint problemsen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
i32-Interval-valued-Gelain-et-al.pdf
Size:
591.15 KB
Format:
Adobe Portable Document Format
Description:
Accepted Version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles