| Autor: |
MAREK, V. W., REMMEL, J. B. |
| Předmět: |
|
| Zdroj: |
Theory & Practice of Logic Programming; 01/01/2011, Vol. 11 Issue 1, p111-123, 13p |
| Abstrakt: |
We investigate a proof system based on a guarded resolution rule and show its adequacy for the stable semantics of normal logic programs. As a consequence, we show that Gelfond–Lifschitz operator can be viewed as a proof-theoretic concept. As an application, we find a propositional theory EP whose models are precisely stable models of programs. We also find a class of propositional theories 퓒P with the following properties. Propositional models of theories in 퓒P are precisely stable models of P, and the theories in 퓒T are of the size linear in the size of P. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
