Abstract
This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs. They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite domains) and recursion. From a theoretical point of view, finitary programs are interesting because they enjoy properties that are extremely unusual for a nonmonotonic formalism, such as compactness. From the application point of view, the theory of finitary programs shows how the existing technology for answer set programming can be extended from problem solving below the second level of the polynomial hierarchy to all semidecidable problems. Moreover, finitary programs allow a more natural encoding of recursive data structures and may increase the performance of credulous reasoners.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2004-76

BibTeX:

@article{REWERSE-RP-2004-76,
	author = {Piero A. Bonatti},
	title = {Reasoning with infinite stable models},
	journal = {Artificial Intelligence},
	year = {2004},
	number = {Volume 156(1)},
	pages = {75--111},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2004-76}
}