Abstract
J. Jafar and P. J. Stuckey (1986) have defined canonical logic programs and shown that for each logic program there exists a semantically equivalent (formalized by a definition of conservative extension) logic program which is canonical. The present author gives a different construction that strengthens their previous results. The author briefly discusses the significance of these results and uses them to give a direct proof of the completeness of negation by failure for ground negations.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE Computer Society |
| Pages | 154-161 |
| Number of pages | 8 |
| ISBN (Print) | 0818607998 |
| State | Published - 1987 |
ASJC Scopus subject areas
- General Engineering