Compactness Properties for Stable Semantics of Logic Programs

Authors:
Victor W. Marek;Jeffrey B. Remmel
Affiliations:
Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046, USA;Department of Mathematics, University of California at San Diego, La Jolla, CA 92093,
Venue:
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Year:
2007

Citing 10
Cited 0

Foundations of logic programming

Foundations of logic programming
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
Arithmetic classification of perfect models of stratified programs

Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Logic programming

Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Splitting a logic program

Proceedings of the eleventh international conference on Logic programming
Extending and implementing the stable model semantics

Artificial Intelligence
Resolution for Skeptical Stable Model Semantics

Journal of Automated Reasoning
Locally Determined Logic Programs

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Stratified Default Theories

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to sets of clauses in the language admitting negations in the bodies a special kind of models, called stable models. This formalism does not have the compactness property. We show a number of conditions that entail a form of compactness for SLP.