Abstract
Methods for dealing with a Horn logic program and one goal are well-known and successful. Here we are concerned with treating logic programa enhanced by some negative literals using the same methods, in particular SLD-resolutlon. We describe the approach and show it. correctness. The result can be applied to default reasoning and has some relevance for model elimination based theorem proving.
Original language | English |
---|---|
Pages (from-to) | 229-241 |
Number of pages | 13 |
Journal | Logic Journal of the IGPL |
Volume | 2 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Sep 1994 |
Externally published | Yes |