Abstract
Automated problem solving in combination with declarative specifications of search-problems have shown to substantially improve the implementation and maintenance costs as well as the man-machine interaction of deployed industrial applications. The knowledge representation and reasoning (KRR) framework of answer set programming (ASP) offers a rich representation language and high performance solvers. Therefore, ASP has become very attractive for the representation and solving of search-problems both for academia and industry. This article focuses on the latest industrial applications of ASP. We do not only present successful applications of ASP but also describe the development process and the design of ASP programs in an industrial context. Finally, we discuss current approaches to tackle the most significant application challenges such as grounding and runtime improvements by heuristics.
Highlights
One of the most successful areas of artificial intelligence (AI) is the automatic generation of solutions for declaratively specified search-problems
answer set programming (ASP) is of particular value for declaratively specified search-problems where an encoding of the problem specification by relations is most appropriate for programmers and domain experts
OOASP has been implemented as a potential extension to any OO modelling environment and its practicability has been evaluated together with CSL (Configuration Specification Language) [19], which is a Siemens-internal tool for the design of product configurators based on the methodology of generative constraint satisfaction problems (GCSPs) [72]
Summary
One of the most successful areas of artificial intelligence (AI) is the automatic generation of solutions for declaratively specified search-problems. Given a searchproblem, a programmer specifies the search space and the required properties such that for every problem instance (i.e. the inputs of a problem solver) the required properties are fulfilled by the solutions (i.e. the outputs of a problem solver). A programmer describes all technically feasible assemblies and the customer requirements an assembled system must satisfy. The automatic generation of solutions to declaratively specified search-problems is extremely interesting for industry because it allows a substantial reduction of implementation and maintenance costs as well as the enhancement of user interactions, e.g. by the generation of explanations of inconsistent requirements. In [30], a reduction of the maintenance costs by more than 80% was reported
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
