{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:49:04Z","timestamp":1761947344521},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T00:00:00Z","timestamp":1157068800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10732-006-7071-x","type":"journal-article","created":{"date-parts":[[2006,5,7]],"date-time":"2006-05-07T16:42:05Z","timestamp":1147020125000},"page":"263-285","source":"Crossref","is-referenced-by-count":21,"title":["Hard and soft constraints for reasoning about qualitative conditional preferences"],"prefix":"10.1007","volume":"12","author":[{"given":"C.","family":"Domshlak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Prestwich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. B.","family":"Venable","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7071_CR1","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. (1996). \u201cSemiring-Based CSPs and Valued CSPs: Basic Properties and Comparison.\u201d In Over-Constrained Systems.","DOI":"10.1007\/3-540-61479-6_19"},{"issue":"2","key":"7071_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S. Bistarelli","year":"1997","unstructured":"Bistarelli, S., U. Montanari, and F. Rossi. (1997). \u201cSemiring-Based Constraint Solving and Optimization.\u201d Journal of the ACM 44(2), 201\u2013236.","journal-title":"Journal of the ACM"},{"key":"7071_CR3","unstructured":"Boutilier, C., R. Brafman, H. Hoos, and D. Poole. (1999). \u201cReasoning with Conditional Ceteris Paribus Preference Statements.\u201d In Proc. of UAI, pp.71\u201380."},{"key":"7071_CR4","unstructured":"Boutilier, C., F. Bacchus, and R.I. Brafman. (2001). \u201cUCP-Networks: A Directed Graphical Representation of Conditional Utilities.\u201d In Proc. of UAI, pp.56\u201364."},{"key":"7071_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C. Boutilier","year":"2004","unstructured":"Boutilier, C., R. Brafman, C. Domshlak, H. Hoos, and D. Poole. (2004). \u201cCP-nets: A Tool for Representing and Reasoning about Conditional. ceteris paribus preference statements.\u201d Journal of Artificial Intelligence Research (JAIR) 21, 135\u2013191.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"2","key":"7071_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1111\/j.0824-7935.2004.00234.x","volume":"20","author":"C. Boutilier","year":"2004","unstructured":"Boutilier, C., R. Brafman, C. Domshlak, H. Hoos, and D. Poole. (2004). \u201cPreference-Based Constraint Optimization with CP-Nets.\u201d Computational Intelligence 20(2), 137\u2013157.","journal-title":"Computational Intelligence"},{"issue":"2","key":"7071_CR7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1111\/j.0824-7935.2004.00236.x","volume":"20","author":"R. Brafman","year":"2004","unstructured":"Brafman, R. and Y. Dimopoulos. (2004). \u201cExtended Semantics and Optimization Algorithms for CP-Networks.\u201d Computational Intelligence 20(2), 218\u2013245.","journal-title":"Computational Intelligence"},{"key":"7071_CR8","unstructured":"Domshlak, C. and R. Brafman. (2002). \u201cCP-Nets\u2013-Reasoning and Consistency Testing.\u201d In Proc. of KR, pp.121\u2013132."},{"key":"7071_CR9","volume-title":"Proc. of IJCAI","author":"C. Domshlak","year":"2003","unstructured":"Domshlak, C., F. Rossi, K.B. Venable, and T. Walsh. (2003). \u201cReasoning About Soft Constraints and Conditional Preferences: Complexity Results and Approximation Techniques.\u201d In Proc. of IJCAI, Acapulco, Mexico, August."},{"issue":"2","key":"7071_CR10","first-page":"55","volume":"20","author":"J. Doyle","year":"1999","unstructured":"Doyle, J. and R.H. Thomason. (1999). \u201cBackground to Qualitative Decision Theory.\u201d AI Magazine 20(2), 55\u201368.","journal-title":"AI Magazine"},{"key":"7071_CR11","unstructured":"Doyle, J. and M. Wellman. (1994). \u201cRepresenting Preferences as Ceteris Paribus Comparatives.\u201d In Proc. of AAAI Spring Symposium on Decision-Making Planning, pp.69\u201375."},{"key":"7071_CR12","doi-asserted-by":"crossref","unstructured":"Dubois, D., H. Fargier, and H. Prade. (1993). \u201cThe Calculus of Fuzzy Restrictions as A Basis for Flexible Constraint Satisfaction.\u201d In Proc. of IEEE International Conference on Fuzzy Systems.","DOI":"10.1109\/FUZZY.1993.327356"},{"key":"7071_CR13","unstructured":"Fargier, H., J. Lang, and T. Schiex. (1993). \u201cSelecting Preferred Solutions in Fuzzy Constraint Satisfaction Problems.\u201d In Proc. of 1st European Congress on Fuzzy and Intelligent Technologies (EUFIT), pp.277\u2013288."},{"issue":"1\u20133","key":"7071_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E.C. Freuder","year":"1992","unstructured":"Freuder, E.C. and R.J. Wallace. (1992). \u201cPartial Constraint Satisfaction.\u201d Artificial Intelligence 58(1\u20133), 21\u201370.","journal-title":"Artificial Intelligence"},{"key":"7071_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R. and D.S. Johnson. (1978). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New-York."},{"key":"7071_CR16","unstructured":"Goldsmith, J., J. Lang, M. Truszczynski, and N. Wilson. (2005). \u201cThe Computational Complexity of Dominance and Consistency in CP-Nets.\u201d In Proc. of IJCAI."},{"key":"7071_CR17","doi-asserted-by":"crossref","unstructured":"Hansson, S.O. (2001). \u201cPreference Logic.\u201d In D.M. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 4, pp.319\u2013394. Kluwer.","DOI":"10.1007\/978-94-017-0456-4_4"},{"key":"7071_CR18","unstructured":"Lang, J. (2002). \u201cFrom Preference Representation to Combinatorial Vote.\u201d In Proc. of KR."},{"key":"7071_CR19","unstructured":"McGeachie, M. and J. Doyle. (2002). \u201cEfficient Utility Functions for Ceteris Paribus Preferences.\u201d In Proc. of AAAI, pp. 279\u2013284."},{"key":"7071_CR20","unstructured":"Meseguer, P., F. Rossi, T. Schiex, and K.B. Venable. (2004). \u201cPrivate Communication.\u201d April."},{"key":"7071_CR21","volume-title":"Proc. of AAAI","author":"S. Prestwich","year":"2005","unstructured":"Prestwich, S., F. Rossi, K.B. Venable, and T. Walsh. (2005). \u201cConstraint-Based Preferential Optimization.\u201d In Proc. of AAAI, Pittsburgh, Pennsylvania, July 9\u201313, Morgan Kaufmann."},{"issue":"4","key":"7071_CR22","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/5254.708432","volume":"13","author":"D. Sabin","year":"1998","unstructured":"Sabin, D. and R. Weigel. (1998). \u201cProduct Configuration Frameworks\u2013-A Survey.\u201d IEEE Intelligent Systems and their Applications 13(4), 42\u201349.","journal-title":"IEEE Intelligent Systems and their Applications"},{"key":"7071_CR23","unstructured":"Schiex, T., H. Fargier, and G. Verfaille. (1995). \u201cValued Constraint Satisfaction Problems: Hard and Easy Problems.\u201d In Proc. of IJCAI, pp. 631\u2013637."},{"key":"7071_CR24","doi-asserted-by":"crossref","unstructured":"Schiex, T. (1992). \u201cPossibilistic Constraint Satisfaction Problems,\u201d or \u201cHow to Handle Soft Constraints?.\u201d In Proc. of UAI, pp. 269\u2013275.","DOI":"10.1016\/B978-1-4832-8287-9.50041-4"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-7071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-006-7071-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-006-7071-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:27Z","timestamp":1559256867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-006-7071-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":24,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["7071"],"URL":"https:\/\/doi.org\/10.1007\/s10732-006-7071-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}