Abstract
Many real-world design problems such as product configuration require a flexible number of components and thus rely on tuple generating dependencies in order to express relations between entities. Often, such problems are subject to optimization, preferring models which include a minimal number of constants substituted in existentially quantified formulas.
In this paper we propose an approach based on automated program rewriting which avoids such substitutions of existentially quantified variables that would lead to a contradiction. While preserving all solutions, the method significantly reduces runtime and solves instances of a class of real-world configuration problems which could not be efficiently solved by current techniques.
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
Aschinger, M., Drescher, C., Vollmer, H.: LoCo – A Logic for Configuration Problems. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 73–78 (2012)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press (2010)
Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Communications of the ACM 54(12), 92–103 (2011)
Calì, A., Gottlob, G., Lukasiewicz, T., Pieris, A.: Datalog+/-: A family of languages for ontology querying. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, pp. 351–368 (2010)
Drescher, C., Tifrea, O., Walsh, T.: Symmetry-breaking Answer Set Solving. AI Communications 24(2), 177–194 (2011)
Fagin, R., Kolaitis, P.G., Popa, L.: Data exchange: getting to the core. ACM Transactions on Database Systems 30(1), 174–210 (2005)
Falkner, A., Feinerer, I., Salzer, G., Schenner, G.: Computing Product Configurations via UML and Integer Linear Programming. Journal of Mass Customisation 3(4), 351–367 (2010)
Feinerer, I.: Efficient large-scale configuration via integer linear programming. AI for Engineering Design, Analysis and Manufacturing 27, 37–49 (2013)
Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of the 9th National Conference on Artificial Intelligence, pp. 227–233 (1991)
Friedrich, G., Ryabokon, A., Falkner, A.A., Haselböck, A., Schenner, G., Schreiner, H.: (Re) configuration based on model generation. In: Proceedings of the Second Workshop on Logics for Component Configuration, LoCoCo, vol. 65, pp. 26–35 (2011)
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: The Potsdam Answer Set Solving Collection. AI Communications 24(2), 107–124 (2011)
Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187-188, 52–89 (2012)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: 5th International Conference and Symposium on Logic Programming, pp. 1070–1080 (1988)
Haselböck, A.: Exploiting interchangeabilities in constraint-satisfaction problems. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 282–289 (1993)
Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently Computable Datalog∃ Programs. In: Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning, pp. 13–23 (2012)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic (TOCL) 7(3), 499–562 (2006)
Mayer, W., Bettex, M., Stumptner, M., Falkner, A.: On solving complex rack configuration problems using CSP methods. In: Proceedings of the Workshop on Configuration (2009)
Ryabokon, A.: Study: Symmetry breaking for ASP. CoRR arXiv:1212.2657 (2012)
Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)
Stumptner, M.: An overview of knowledge-based configuration. AI Communications 10(2), 111–125 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryabokon, A., Friedrich, G., Falkner, A.A. (2013). Conflict-Based Program Rewriting for Solving Configuration Problems. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_46
Download citation
DOI: https://doi.org/10.1007/978-3-642-40564-8_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40563-1
Online ISBN: 978-3-642-40564-8
eBook Packages: Computer ScienceComputer Science (R0)