Abstract
When configuring customizable software, it is useful to provide interactive tool-support that ensures that the configuration does not breach given constraints. But, when is a configuration complete and how can the tool help the user to complete it? We formalize this problem and relate it to concepts from non-monotonic reasoning well researched in Artificial Intelligence. The results are interesting for both practitioners and theoreticians. Practitioners will find a technique facilitating an interactive configuration process and experiments supporting feasibility of the approach. Theoreticians will find links between well-known formal concepts and a concrete practical application.
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
Batory, D.: Feature Models, Grammars, and Propositional Formulas. In: Obbink, H., Pohl, K. (eds.) SPLC 2005. LNCS, vol. 3714, pp. 7–20. Springer, Heidelberg (2005)
Benavides, D., Trinidad, P., Ruiz-Cortés, A.: Automated Reasoning on Feature Models. In: Pastor, Ó., Falcão e Cunha, J. (eds.) CAiSE 2005. LNCS, vol. 3520, pp. 491–503. Springer, Heidelberg (2005)
Cadoli, M., Lenzerini, M.: The Complexity of Closed World Reasoning and Circumscription. In: The Eighth National Conference on Artificial Intelligence (1990)
Clements, P., Northrop, L.: Software Product Lines: Practices and Patterns. Addison-Wesley, Reading (2002)
Czarnecki, K., Helsen, S., Eisenecker, U.: Staged Configuration Using Feature Models. In: Nord, R.L. (ed.) SPLC 2004. LNCS, vol. 3154, pp. 266–283. Springer, Heidelberg (2004)
Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence 20(2), 308–334 (2004)
Eiter, T., Gottlob, G.: Propositional Circumscription and Extended Closed World Reasoning Are \(\Pi^P_2\)-Complete. Theoretical Computer Science (1993)
Hadzic, T., Subbarayan, S., Jensen, R., Andersen, H., Møller, J., Hulgaard, H.: Fast Backtrack-Free Product Configuration Using a Precompiled Solution Space Representation. In: The International Conference on Economic, Technical and Organizational Aspects of Product Configuration Systems, DTU (2004)
Janota, M.: Do SAT Solvers Make Good Configurators? In: First Workshop on Analyses of Software Product Lines, ASPL (2008)
Janota, M., Kiniry, J.: Reasoning about Feature Models in High-Order Logic. In: SPLC (2007)
Janota, M., Kuzina, V., Wasowski, A.: Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax. In: Czarnecki, K., Ober, I., Bruel, J.-M., Uhl, A., Völter, M. (eds.) MODELS 2008. LNCS, vol. 5301, pp. 431–445. Springer, Heidelberg (2008)
Janota, M., Marques-Silva, J., Grigore, R.: Algorithms for Finding Dispensable Variables, http://arXiv.org/abs/0910.0013
Junker, U.: Preference Programming for Configuration. In: Workshop on Configuration (2001)
Kang, K.C., Cohen, S.G., Hess, J.A., Novak, W.E., Peterson, A.S.: Feature-Oriented Domain Analysis (FODA), feasibility study. Technical Report, SEI, Carnegie Mellon University (1990)
Kavvadias, D.J., Sideri, M., Stavropoulos, E.C.: Generating All Maximal Models of a Boolean Expression. Information Processing Letters (2000)
Krebs, T., Wagner, T., Runte, W.: Recognizing User Intentions in Incremental Configuration Processes. In: Workshop on Configuration (2003)
Lottaz, C., Stalker, R., Smith, I.: Constraint Solving and Preference Activation for Interactive Design. AI EDAM 12(01), 13–27 (1998)
McCarthy, J.: Circumscription—a Form of Non-Monotonic Reasoning. Artificial Intelligence 13, 27–39 (1980)
Minker, J.: On Indefinite Databases and the Closed World Assumption. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol. 138. Springer, Heidelberg (1982)
Parnas, D.L.: On the Design and Development of Program Families. IEEE Transactions on Software Engineering (1976)
Reiter, R., de Kleer, J.: Foundations of Assumption-Based Truth Maintenance Systems: Preliminary Report. In: Proceedings of AAAI (1987)
Sabin, D., Weigel, R.: Product Configuration Frameworks-a Survey. IEEE Intelligent Systems 13(4), 42–49 (1998)
Schobbens, P.-Y., Heymans, P., Trigaux, J.-C.: Feature Diagrams: A Survey and a Formal Semantics. In: Requirements Engineering Conference, RE (2006)
van der Meer, E.R., Wasowski, A., Andersen, H.R.: Efficient Interactive Configuration of Unbounded Modular Systems. In: Symp. Applied Comput. (SAC) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janota, M., Botterweck, G., Grigore, R., Marques-Silva, J. (2010). How to Complete an Interactive Configuration Process?. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)