Canonical logic programs

Joxan Jaffar, Peter J. Stuckey

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Consider the class of programs P where the greatest fixpoint of TP is equal to the complement of the finite failure set of P. Programs in this calss possess some important properties which others do not. The main result in this paper proves that this class is representative of all programs. Specifically, we call the programs in this class canonical and we prove that for any program P1, there exists a semantically equivalent program P2 which is canonical.

Original languageEnglish
Pages (from-to)143-155
Number of pages13
JournalThe Journal of Logic Programming
Volume3
Issue number2
DOIs
Publication statusPublished - 1 Jan 1986

Cite this