An overview of machine learning techniques in constraint solving.

Autor:	Popescu, Andrei, Polat-Erdeniz, Seda, Felfernig, Alexander, Uta, Mathias, Atas, Müslüm, Le, Viet-Man, Pilsl, Klaus, Enzelsberger, Martin, Tran, Thi Ngoc Trang
Předmět:	MACHINE learning CONSTRAINT satisfaction PRODUCTION scheduling INTERNET sales PROBLEM solving DECORATIVE arts
Zdroj:	Journal of Intelligent Information Systems; Feb2022, Vol. 58 Issue 1, p91-118, 28p
Abstrakt:	Constraint solving is applied in different application contexts. Examples thereof are the configuration of complex products and services, the determination of production schedules, and the determination of recommendations in online sales scenarios. Constraint solvers apply, for example, search heuristics to assure adequate runtime performance and prediction quality. Several approaches have already been developed showing that machine learning (ML) can be used to optimize search processes in constraint solving. In this article, we provide an overview of the state of the art in applying ML approaches to constraint solving problems including constraint satisfaction, SAT solving, answer set programming (ASP) and applications thereof such as configuration, constraint-based recommendation, and model-based diagnosis. We compare and discuss the advantages and disadvantages of these approaches and point out relevant directions for future work. [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Full text from SpringerLink