Coherent well-founded annotated logic programs

Carlos Viegas Damásio, Luís Moniz Pereira, Terrance Swift

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

Abstract

Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programs in order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpreted by explicitly annotating atoms with elements of a new domain of truth values. In this paper coherent well-founded annotated programs are defined, and shown to generalize both consistent and paraconsistent extended programs, along with several classes of annotated programs.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages262-276
Number of pages15
Volume1730
ISBN (Print)3540667490, 9783540667490
DOIs
StatePublished - 1999
Externally publishedYes
Event5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 - El Paso, United States
Duration: Dec 2 1999Dec 4 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1730
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999
CountryUnited States
CityEl Paso
Period12/2/9912/4/99

Fingerprint

Logic Programs
Atoms
Generalise
Truth

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Damásio, C. V., Pereira, L. M., & Swift, T. (1999). Coherent well-founded annotated logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1730, pp. 262-276). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730). Springer Verlag. https://doi.org/10.1007/3-540-46767-X_19

Coherent well-founded annotated logic programs. / Damásio, Carlos Viegas; Pereira, Luís Moniz; Swift, Terrance.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1730 Springer Verlag, 1999. p. 262-276 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1730).

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

Damásio, CV, Pereira, LM & Swift, T 1999, Coherent well-founded annotated logic programs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1730, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1730, Springer Verlag, pp. 262-276, 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999, El Paso, United States, 12/2/99. https://doi.org/10.1007/3-540-46767-X_19
Damásio CV, Pereira LM, Swift T. Coherent well-founded annotated logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1730. Springer Verlag. 1999. p. 262-276. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-46767-X_19
Damásio, Carlos Viegas ; Pereira, Luís Moniz ; Swift, Terrance. / Coherent well-founded annotated logic programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1730 Springer Verlag, 1999. pp. 262-276 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0eb85e3e1dc64fd080c24a10b6293beb,
title = "Coherent well-founded annotated logic programs",
abstract = "Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programs in order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpreted by explicitly annotating atoms with elements of a new domain of truth values. In this paper coherent well-founded annotated programs are defined, and shown to generalize both consistent and paraconsistent extended programs, along with several classes of annotated programs.",
author = "Dam{\'a}sio, {Carlos Viegas} and Pereira, {Lu{\'i}s Moniz} and Terrance Swift",
year = "1999",
doi = "10.1007/3-540-46767-X_19",
language = "English (US)",
isbn = "3540667490",
volume = "1730",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "262--276",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Coherent well-founded annotated logic programs

AU - Damásio, Carlos Viegas

AU - Pereira, Luís Moniz

AU - Swift, Terrance

PY - 1999

Y1 - 1999

N2 - Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programs in order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpreted by explicitly annotating atoms with elements of a new domain of truth values. In this paper coherent well-founded annotated programs are defined, and shown to generalize both consistent and paraconsistent extended programs, along with several classes of annotated programs.

AB - Extended logic programs and annotated logic programs are two important extensions of normal logic programs that allow for a more concise and declarative representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programs in order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpreted by explicitly annotating atoms with elements of a new domain of truth values. In this paper coherent well-founded annotated programs are defined, and shown to generalize both consistent and paraconsistent extended programs, along with several classes of annotated programs.

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

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

U2 - 10.1007/3-540-46767-X_19

DO - 10.1007/3-540-46767-X_19

M3 - Conference contribution

AN - SCOPUS:84958595643

SN - 3540667490

SN - 9783540667490

VL - 1730

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 262

EP - 276

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -