Canonical logic programs

Joxan Jaffar; Peter J. Stuckey

doi:10.1016/0743-1066(86)90020-8

Canonical logic programs

Joxan Jaffar, Peter J. Stuckey

Department of Data Science & AI

Research output: Contribution to journal › Article › Research › peer-review

17 Citations (Scopus)

Abstract

Consider the class of programs P where the greatest fixpoint of T_P 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 P₁, there exists a semantically equivalent program P₂ which is canonical.

Original language	English
Pages (from-to)	143-155
Number of pages	13
Journal	The Journal of Logic Programming
Volume	3
Issue number	2
DOIs	https://doi.org/10.1016/0743-1066(86)90020-8
Publication status	Published - 1 Jan 1986

Access to Document

10.1016/0743-1066(86)90020-8

Cite this

@article{a7272714466a48fea867defece33809c,

title = "Canonical logic programs",

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.",

author = "Joxan Jaffar and Stuckey, {Peter J.}",

year = "1986",

month = jan,

day = "1",

doi = "10.1016/0743-1066(86)90020-8",

language = "English",

volume = "3",

pages = "143--155",

journal = "The Journal of Logic Programming",

issn = "0743-1066",

number = "2",

}

TY - JOUR

T1 - Canonical logic programs

AU - Jaffar, Joxan

AU - Stuckey, Peter J.

PY - 1986/1/1

Y1 - 1986/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0009052349&partnerID=8YFLogxK

U2 - 10.1016/0743-1066(86)90020-8

DO - 10.1016/0743-1066(86)90020-8

M3 - Article

AN - SCOPUS:0009052349

SN - 0743-1066

VL - 3

SP - 143

EP - 155

JO - The Journal of Logic Programming

JF - The Journal of Logic Programming

IS - 2

ER -

Canonical logic programs

Abstract

Access to Document

Other files and links

Cite this