Locally Determined Logic Programs

Authors:
Douglas A. Cenzer;Jeffrey B. Remmel;Amy Vanderbilt
Affiliations:
-;-;-
Venue:
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
1999

Citing 2
Cited 2

Arithmetic classification of perfect models of stratified programs

Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Logic programming

Handbook of theoretical computer science (vol. B)

Compactness Properties for Stable Semantics of Logic Programs

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Compactness Properties for Stable Semantics of Logic Programs

Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk

Quantified Score

Hi-index	0.00

Visualization

Abstract

In general, the set of stable models of a recursive propositional logic program can be quite complex. For example, it follows from results of Marek, Nerode, and Remmel [8] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models. In this paper, we shall define several conditions which ensure that recursive logic program has a stable model which is recursive.