Abstract
Tradeoffs have been proposed in the literature as an approach to resolving over-constrainedness in interactive constraint-based tools, such as product configurators, that reason about user preferences . It has been reported how tradeoffs can be modeled as additional constraints. This paper presents a formal framework for tradeoff generation based on the semiring approach to soft constraints. In particular, user preferences and tradeoffs are represented as soft constraints and as an entailment operator, respectively. The entailment operator is used to interactively generate new constraints representing tradeoffs. We also introduce a novel definit ion of substitutability for soft constraints upon which we present a relaxed definition of tradeoffs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Amilhastre, H. Fargier, and P. Marguis. Consistency restoration and explanations in dynamic CSPs-application to configuration. Artificial Intelligence, 135:199–234, 2002.
S. Bistarelli, B. Faltings, and N. Neagu. A definition of interchangeability for soft CSPs. In Barry O’Sullivan, editor, Recent Advances in Constraints, volume 2627 of LNAI, pages 31–46, 2003.
S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and Valued CSPs: Frameworks, properties, and comparison. CONSTRAINTS: An international journal. Kluwer, 4(3), 1999.
S. Bistarelli, U. Montanari, and F. Rossi. Constraint Solving over Semirings. In Proc. IJCAI95, San Francisco, CA, USA, 1995. Morgan Kaufman.
S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201–236, Mar 1997.
S. Bistarelli, U. Montanari, and F. Rossi. Soft concurrent constraint programming. In Proc. 11th European Symposium on Programming (ESOP), Lecture Notes in Computer Science (LNCS), pages 53–67. Springer, 2002.
A. Felfernig, G. Friedrich, D. Jannach, and M. Stumpter. Consistencybased diagnosis of configuration knowledge-bases. In Proceedings of the 14h European Conference on Artificial Intelligence (ECAI’2000), pages 146–150, 2000.
E.C. Freuder and B. O’Sullivan. Generating tradeoffs for interactive constraint-based configuration. In Proceedings of CP-2001, pages 590–594, Nov 2001.
E.C. Freuder, C. Likitvivatanavong, M. Moretti, F. Rossi, and R.J. Wallace. Computing explanations and implications in preference-based configurators. In Barry O’Sullivan, editor, Recent Advances in Constraints, volume 2627 of LNAI, pages 76–92, 2003.
J T. Frühwirth. Constraint handling rules. In Constraint Programming: Basics and Trends, volume 910 of Lecture Notes in Computer Science (LNCS), pages 90–107. Springer, 1995.
P. Jeavons, D. Cohen, and M. Copper. A substitution operation for constraints. In Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming — CP-94, volume 874 of LNCS, 1994.
D. Sabin and R. Weigel. Product configuration frameworks — a survey. IEEE Intelligent Systems and their applications, 13(4):42–49, July-August 1998. Special Issue on Configuration.
V.A. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this paper
Cite this paper
Bistarelli, S., O’Sullivan, B. (2004). A Theoretical Framework for Tradeoff Generation using Soft Constraints. In: Coenen, F., Preece, A., Macintosh, A. (eds) Research and Development in Intelligent Systems XX. SGAI 2003. Springer, London. https://doi.org/10.1007/978-0-85729-412-8_6
Download citation
DOI: https://doi.org/10.1007/978-0-85729-412-8_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-780-3
Online ISBN: 978-0-85729-412-8
eBook Packages: Springer Book Archive