{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T23:11:23Z","timestamp":1790637083448,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642112652","type":"print"},{"value":"9783642112669","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_44","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"528-539","source":"Crossref","is-referenced-by-count":11,"title":["How to Complete an Interactive Configuration Process?"],"prefix":"10.1007","author":[{"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goetz","family":"Botterweck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Radu","family":"Grigore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/11554844_3","volume-title":"Software Product Lines","author":"D. Batory","year":"2005","unstructured":"Batory, D.: Feature Models, Grammars, and Propositional Formulas. In: Obbink, H., Pohl, K. (eds.) SPLC 2005. LNCS, vol.\u00a03714, pp. 7\u201320. Springer, Heidelberg (2005)"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","first-page":"491","volume-title":"Advanced Information Systems Engineering","author":"D. Benavides","year":"2005","unstructured":"Benavides, D., Trinidad, P., Ruiz-Cort\u00e9s, A.: Automated Reasoning on Feature Models. In: Pastor, \u00d3., Falc\u00e3o e Cunha, J. (eds.) CAiSE 2005. LNCS, vol.\u00a03520, pp. 491\u2013503. Springer, Heidelberg (2005)"},{"key":"44_CR3","unstructured":"Cadoli, M., Lenzerini, M.: The Complexity of Closed World Reasoning and Circumscription. In: The Eighth National Conference on Artificial Intelligence (1990)"},{"key":"44_CR4","volume-title":"Software Product Lines: Practices and Patterns","author":"P. Clements","year":"2002","unstructured":"Clements, P., Northrop, L.: Software Product Lines: Practices and Patterns. Addison-Wesley, Reading (2002)"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/978-3-540-28630-1_17","volume-title":"Software Product Lines","author":"K. Czarnecki","year":"2004","unstructured":"Czarnecki, K., Helsen, S., Eisenecker, U.: Staged Configuration Using Feature Models. In: Nord, R.L. (ed.) SPLC 2004. LNCS, vol.\u00a03154, pp. 266\u2013283. Springer, Heidelberg (2004)"},{"issue":"2","key":"44_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1111\/j.0824-7935.2004.00240.x","volume":"20","author":"J. Delgrande","year":"2004","unstructured":"Delgrande, J., Schaub, T., Tompits, H., Wang, K.: A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence\u00a020(2), 308\u2013334 (2004)","journal-title":"Computational Intelligence"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Eiter, T., Gottlob, G.: Propositional Circumscription and Extended Closed World Reasoning Are $\\Pi^P_2$ -Complete. Theoretical Computer Science (1993)","DOI":"10.1016\/0304-3975(93)90113-8"},{"key":"44_CR8","unstructured":"Hadzic, T., Subbarayan, S., Jensen, R., Andersen, H., M\u00f8ller, J., Hulgaard, H.: Fast Backtrack-Free Product Configuration Using a\u00a0Precompiled Solution Space Representation. In: The International Conference on Economic, Technical and Organizational Aspects of Product Configuration Systems, DTU (2004)"},{"key":"44_CR9","unstructured":"Janota, M.: Do SAT Solvers Make Good Configurators? In: First Workshop on Analyses of Software Product Lines, ASPL (2008)"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Janota, M., Kiniry, J.: Reasoning about Feature Models in High-Order Logic. In: SPLC (2007)","DOI":"10.1109\/SPLINE.2007.36"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-87875-9_31","volume-title":"Model Driven Engineering Languages and Systems","author":"M. Janota","year":"2008","unstructured":"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\u00f6lter, M. (eds.) MODELS 2008. LNCS, vol.\u00a05301, pp. 431\u2013445. Springer, Heidelberg (2008)"},{"key":"44_CR12","unstructured":"Janota, M., Marques-Silva, J., Grigore, R.: Algorithms for Finding Dispensable Variables, http:\/\/arXiv.org\/abs\/0910.0013"},{"key":"44_CR13","unstructured":"Junker, U.: Preference Programming for Configuration. In: Workshop on Configuration (2001)"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Kang, K.C., Cohen, S.G., Hess, J.A., Novak, W.E., Peterson, A.S.: Feature-Oriented Domain Analysis\u00a0(FODA), feasibility study. Technical Report, SEI, Carnegie Mellon University (1990)","DOI":"10.21236\/ADA235785"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Kavvadias, D.J., Sideri, M., Stavropoulos, E.C.: Generating All Maximal Models of a Boolean Expression. Information Processing Letters (2000)","DOI":"10.1016\/S0020-0190(00)00023-5"},{"key":"44_CR16","unstructured":"Krebs, T., Wagner, T., Runte, W.: Recognizing User Intentions in Incremental Configuration Processes. In: Workshop on Configuration (2003)"},{"issue":"01","key":"44_CR17","first-page":"13","volume":"12","author":"C. Lottaz","year":"1998","unstructured":"Lottaz, C., Stalker, R., Smith, I.: Constraint Solving and Preference Activation for Interactive Design. AI\u00a0EDAM\u00a012(01), 13\u201327 (1998)","journal-title":"AI\u00a0EDAM"},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription\u2014a Form of Non-Monotonic Reasoning. Artificial Intelligence\u00a013, 27\u201339 (1980)","journal-title":"Artificial Intelligence"},{"key":"44_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0000066","volume-title":"6th Conference on Automated Deduction","author":"J. Minker","year":"1982","unstructured":"Minker, J.: On Indefinite Databases and the Closed World Assumption. In: Loveland, D.W. (ed.) CADE 1982. LNCS, vol.\u00a0138. Springer, Heidelberg (1982)"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Parnas, D.L.: On the Design and Development of Program Families. IEEE Transactions on Software Engineering (1976)","DOI":"10.1109\/TSE.1976.233797"},{"key":"44_CR21","unstructured":"Reiter, R., de Kleer, J.: Foundations of Assumption-Based Truth Maintenance Systems: Preliminary Report. In: Proceedings of AAAI (1987)"},{"issue":"4","key":"44_CR22","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/5254.708432","volume":"13","author":"D. Sabin","year":"1998","unstructured":"Sabin, D., Weigel, R.: Product Configuration Frameworks-a Survey. IEEE Intelligent Systems\u00a013(4), 42\u201349 (1998)","journal-title":"IEEE Intelligent Systems"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Schobbens, P.-Y., Heymans, P., Trigaux, J.-C.: Feature Diagrams: A Survey and a Formal Semantics. In: Requirements Engineering Conference, RE (2006)","DOI":"10.1109\/RE.2006.23"},{"key":"44_CR24","doi-asserted-by":"crossref","unstructured":"van der Meer, E.R., Wasowski, A., Andersen, H.R.: Efficient Interactive Configuration of Unbounded Modular Systems. In: Symp. Applied Comput.\u00a0(SAC) (2006)","DOI":"10.1145\/1141277.1141370"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:45:07Z","timestamp":1558687507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}