CANONICAL CONSERVATIVE EXTENSIONS OF LOGIC PROGRAM COMPLETIONS.

Howard A. Blair

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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 languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE Computer Society
Pages154-161
Number of pages8
ISBN (Print)0818607998
StatePublished - Dec 1 1987

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Blair, H. A. (1987). CANONICAL CONSERVATIVE EXTENSIONS OF LOGIC PROGRAM COMPLETIONS. In Unknown Host Publication Title (pp. 154-161). IEEE Computer Society.