Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Compactness Properties for Stable Semantics of Logic Programs

Marek V.W., Remmel J.B.

Fundamenta Informaticae

2007

Vol. 81, nr 1-3

211-239

Logic programming with stable logic semantics (SLP) is a logical formalism that assigns to programs, i.e. sets of clauses where we allow both atoms and their negations in the body of clause, a special class of models of the program, called stable models. We show that stable logic semantics does not satisfy the natural analogue of the compactness theorem. However, we show that there are a variety of conditions which will ensure that a program satisfies the analogue of the compactness theorem.