Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

LFCS
2007
Springer

favoriteEmaildiscussreport

115views Artificial Intelligence» more LFCS 2007»

Compactness Properties for Stable Semantics of Logic Programs

15 years 4 months ago

Compactness Properties for Stable Semantics of Logic Programs

Download www.cs.uky.edu

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.

Victor W. Marek, Jeffrey B. Remmel

Real-time Traffic

Language Admitting Negations | LFCS 2007 | Logical Formalism | Stable Logic Semantics |

claim paper

Related Content

» SemiStable Semantics

» Revised Stable Models A Semantics for Logic Programs

» Uniform Equivalence of Logic Programs under the Stable Model Semantics

» Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Progr...

» On the existence of stable models of nonstratified logic programs

» Partial equilibrium logic

» Considerations on Updates of Logic Programs

» Bounded LTL Model Checking with Stable Models

» Induction of Stable Models

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	LFCS
Authors	Victor W. Marek, Jeffrey B. Remmel

Comments (0)