Most specific logic programs

K. Marriott, L. Naish, J. L. Lassez

Research output: Contribution to journalArticleResearchpeer-review

14 Citations (Scopus)

Abstract

More specific versions of definite logic programs are introduced. These are versions of a program in which each clause is further instantiated or removed and which have an equivalent set of successful derivations to those of the original program, but a possibly increased set of finitely failed goals. They are better than the original program because failure in a non-successful derivation may be detected more quickly. Furthermore, information about allowed variable bindings which is hidden in the original program may be made explicit in a more specific version of it. This allows better static analysis of the program's properties and may reveal errors in the original program. A program may have several more specific versions but there is always a most specific version which is unique up to variable renaming. Methods to calculate more specific versions are given and it is characterized when they give the most specific version.

Original languageEnglish
Pages (from-to)303-338
Number of pages36
JournalAnnals of Mathematics and Artificial Intelligence
Volume1
Issue number1-4
DOIs
Publication statusPublished - 1 Sep 1990
Externally publishedYes

Keywords

  • Logic programs
  • specific logic programs

Cite this

Marriott, K. ; Naish, L. ; Lassez, J. L. / Most specific logic programs. In: Annals of Mathematics and Artificial Intelligence. 1990 ; Vol. 1, No. 1-4. pp. 303-338.
@article{70aaca8c8b204ea8883fc4369d40a60f,
title = "Most specific logic programs",
abstract = "More specific versions of definite logic programs are introduced. These are versions of a program in which each clause is further instantiated or removed and which have an equivalent set of successful derivations to those of the original program, but a possibly increased set of finitely failed goals. They are better than the original program because failure in a non-successful derivation may be detected more quickly. Furthermore, information about allowed variable bindings which is hidden in the original program may be made explicit in a more specific version of it. This allows better static analysis of the program's properties and may reveal errors in the original program. A program may have several more specific versions but there is always a most specific version which is unique up to variable renaming. Methods to calculate more specific versions are given and it is characterized when they give the most specific version.",
keywords = "Logic programs, specific logic programs",
author = "K. Marriott and L. Naish and Lassez, {J. L.}",
year = "1990",
month = "9",
day = "1",
doi = "10.1007/BF01531082",
language = "English",
volume = "1",
pages = "303--338",
journal = "Annals of Mathematics and Artificial Intelligence",
issn = "1012-2443",
publisher = "Springer-Verlag London Ltd.",
number = "1-4",

}

Most specific logic programs. / Marriott, K.; Naish, L.; Lassez, J. L.

In: Annals of Mathematics and Artificial Intelligence, Vol. 1, No. 1-4, 01.09.1990, p. 303-338.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Most specific logic programs

AU - Marriott, K.

AU - Naish, L.

AU - Lassez, J. L.

PY - 1990/9/1

Y1 - 1990/9/1

N2 - More specific versions of definite logic programs are introduced. These are versions of a program in which each clause is further instantiated or removed and which have an equivalent set of successful derivations to those of the original program, but a possibly increased set of finitely failed goals. They are better than the original program because failure in a non-successful derivation may be detected more quickly. Furthermore, information about allowed variable bindings which is hidden in the original program may be made explicit in a more specific version of it. This allows better static analysis of the program's properties and may reveal errors in the original program. A program may have several more specific versions but there is always a most specific version which is unique up to variable renaming. Methods to calculate more specific versions are given and it is characterized when they give the most specific version.

AB - More specific versions of definite logic programs are introduced. These are versions of a program in which each clause is further instantiated or removed and which have an equivalent set of successful derivations to those of the original program, but a possibly increased set of finitely failed goals. They are better than the original program because failure in a non-successful derivation may be detected more quickly. Furthermore, information about allowed variable bindings which is hidden in the original program may be made explicit in a more specific version of it. This allows better static analysis of the program's properties and may reveal errors in the original program. A program may have several more specific versions but there is always a most specific version which is unique up to variable renaming. Methods to calculate more specific versions are given and it is characterized when they give the most specific version.

KW - Logic programs

KW - specific logic programs

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

U2 - 10.1007/BF01531082

DO - 10.1007/BF01531082

M3 - Article

VL - 1

SP - 303

EP - 338

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 1-4

ER -