Representation Results for Defeasible Logic

G. Antoniou, D. Billington, G. Governatori, M. J. Maher

Research output: Contribution to journalArticle

236 Citations (Scopus)

Abstract

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.

LanguageEnglish
Pages255-287
Number of pages33
JournalACM Transactions on Computational Logic
Volume2
Issue number2
DOIs
Publication statusPublished - 1 Apr 2001
Externally publishedYes

Fingerprint

Logic programming
Computer science
Logic
Normal Form
Nonmonotonic Reasoning
Logic Programming
Efficient Implementation
Computer Science

Cite this

Antoniou, G. ; Billington, D. ; Governatori, G. ; Maher, M. J. / Representation Results for Defeasible Logic. In: ACM Transactions on Computational Logic. 2001 ; Vol. 2, No. 2. pp. 255-287.
@article{2efa29f421fd4ca78cfef28f9f37b73a,
title = "Representation Results for Defeasible Logic",
abstract = "The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.",
keywords = "Defeasible logic, normal forms, Theory, transformations",
author = "G. Antoniou and D. Billington and G. Governatori and Maher, {M. J.}",
year = "2001",
month = "4",
day = "1",
doi = "10.1145/371316.371517",
language = "English",
volume = "2",
pages = "255--287",
journal = "ACM Transactions on Computational Logic",
issn = "1529-3785",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

Representation Results for Defeasible Logic. / Antoniou, G.; Billington, D.; Governatori, G.; Maher, M. J.

In: ACM Transactions on Computational Logic, Vol. 2, No. 2, 01.04.2001, p. 255-287.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Representation Results for Defeasible Logic

AU - Antoniou, G.

AU - Billington, D.

AU - Governatori, G.

AU - Maher, M. J.

PY - 2001/4/1

Y1 - 2001/4/1

N2 - The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.

AB - The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.

KW - Defeasible logic

KW - normal forms

KW - Theory

KW - transformations

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

U2 - 10.1145/371316.371517

DO - 10.1145/371316.371517

M3 - Article

VL - 2

SP - 255

EP - 287

JO - ACM Transactions on Computational Logic

T2 - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

SN - 1529-3785

IS - 2

ER -