On the decidability of FDNC programs

Issue title: Evolutionary Computation – A Journey in Computational Logic in Italy – Dedicated to Prof. Alberto Martelli

Article type: Research Article

Authors: Bonatti, Piero A.

Affiliations: Department of Physics, University of Napoli Federico II, via Cinthia, I-80126 Napoli, Italy E-mail: [email protected]

Abstract: We provide a new decidability proof for the consistency of FDNC programs under the stable model semantics, based on regular splitting sequences. With this technique, we can slightly relax the definition of FDNC programs and make a first step towards a precise understanding of the relationships between FDNC programs and finitely recursive programs.

Keywords: Answer set programming, finitely recursive, finitary, and FDNC programs, module sequences

DOI: 10.3233/IA-2011-0009

Journal: Intelligenza Artificiale, vol. 5, no. 1, pp. 89-93, 2011