Compactness Properties for Stable Semantics of Logic Programs

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.

• Type: Conference
• Year: 2007
• Where: LFCS
• Authors: Victor W. Marek, Jeffrey B. Remmel
• Keywords: Language Admitting Negations, LFCS 2007, Logical Formalism, Stable Logic Semantics