zbMATH — the first resource for mathematics

Compactness properties for stable semantics of logic programs. (English) Zbl 1133.68013
Artemov, Sergei N. (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72732-3/pbk). Lecture Notes in Computer Science 4514, 379-400 (2007).
Summary: 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.
For the entire collection see [Zbl 1121.03005].

68N17 Logic programming
68Q55 Semantics in the theory of computing
03B70 Logic in computer science
Full Text: DOI