Translating ASP to a typed language without Herbrand functions
Joachim Jansen, Gerda Janssens · Lirias · 2015
Answer Set Programming (ASP) and FO(·) are two similar state-of-the-art languages for declarative problem solving. This paper presents an automatic transformation from ASP programs to FO(·) programs for the IDP3 system. There are two main language differences that have to be overcome. Firstly there is the introduction of types, which are mandatory in FO(·) but not present in ASP. Secondly there are Herbrand function terms that are present in ASP but not sufficiently supported in IDP3. In this paper we give a short overview of both languages and introduce our transformation that overcomes these differences in the respective languages.