Finitely recursive programs: Decidability and bottom–up computation
Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone · AI Communications · 2011
The support for function symbols in logic programming under answer set semantics allows us to overcome some modeling limitations of traditional Answer Set Programming (ASP) systems, such as the inability of handling infinite domains. On the other han