The Institute for Applied Computer Science, Research Group Intelligent Systems and Business Informatics invites you to the habilitation colloquium of Dr. Erich Teppan.
Time: Thursday, 18 January 2018, Start: 14:30 s. t.
Place: AAU, HS 2
Abstract: Constraint answer set programming (CASP) is a family of hybrid approaches integrating answer set programming (ASP) and constraint programming (CP). These hybrid approaches have already proven to be successful in various domains. In this talk the approach of heuristic CASP (HCASP) is presented. In HCASP, ASP is not only used for expressing constraint satisfaction problems (CSPs) to be solved by a CP solver, but also for the encoding of search heuristics that are exploited by the CP solver. In particular, the HCASP solver ASCASS (A Simple Constraint Answer Set Solver), which provides novel methods for defining and exploiting search heuristics, is presented.