Revising Nonmonotonic Theories: The Case of Defeasible Logic

D. Billington; G. Antoniou; G. Governatori; M. Maher

doi:10.1007/3-540-48238-5_8

Revising Nonmonotonic Theories: The Case of Defeasible Logic

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Citations (Scopus)

Abstract

The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising first order theories. Nonmonotonic reasoning provides rigorous techniques for reasoning with incomplete information. Until recently the dynamics of nonmonotonic reasoning approaches has attracted little attention. This paper studies the dynamics of defeasible logic, a simple and efficient form of nonmonotonic reasoning based on defeasible rules and priorities. We define revision and contraction operators and propose postulates. Our postulates try to follow the ideas of AGM belief revision as far as possible, but some AGM postulates clearly contradict the nonmonotonic nature of defeasible logic, as we explain. Finally we verify that the operators satisfy the postulates.

Original language	English
Title of host publication	KI-1999
Subtitle of host publication	Advances in Artificial Intelligence - 23rd Annual German Conference on Artificial Intelligence Bonn, Germany, September 13–15, 1999 Proceedings
Editors	Wolfram Burgard, Armin B. Cremers, Thomas Cristaller
Place of Publication	Berlin
Publisher	Springer Verlag
Pages	101-112
Number of pages	12
Volume	LNCS/LNAI 1701
Edition	1st
ISBN (Electronic)	9783540482383
ISBN (Print)	3540664955, 9783540664956
DOIs	https://doi.org/10.1007/3-540-48238-5_8
Publication status	Published - 1 Sep 1999
Externally published	Yes
Event	23rd Annual German Conference on Artificial Intelligence - Bonn, Germany Duration: 13 Sep 1999 → 15 Sep 1999 Conference number: 23

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Volume	1701 LNCS/LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	23rd Annual German Conference on Artificial Intelligence
Abbreviated title	KI 1999
Country/Territory	Germany
City	Bonn
Period	13/09/99 → 15/09/99

Access to Document

10.1007/3-540-48238-5_8Licence: Unspecified

Cite this

Billington, D., Antoniou, G., Governatori, G., & Maher, M. (1999). Revising Nonmonotonic Theories: The Case of Defeasible Logic. In W. Burgard, A. B. Cremers, & T. Cristaller (Eds.), KI-1999: Advances in Artificial Intelligence - 23rd Annual German Conference on Artificial Intelligence Bonn, Germany, September 13–15, 1999 Proceedings (1st ed., Vol. LNCS/LNAI 1701, pp. 101-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1701 LNCS/LNAI). Springer Verlag. https://doi.org/10.1007/3-540-48238-5_8

Billington, D. ; Antoniou, G. ; Governatori, G. et al. / Revising Nonmonotonic Theories : The Case of Defeasible Logic. KI-1999: Advances in Artificial Intelligence - 23rd Annual German Conference on Artificial Intelligence Bonn, Germany, September 13–15, 1999 Proceedings. editor / Wolfram Burgard ; Armin B. Cremers ; Thomas Cristaller. Vol. LNCS/LNAI 1701 1st. ed. Berlin : Springer Verlag, 1999. pp. 101-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a976730966424db8ac214dfd94f338f4,

title = "Revising Nonmonotonic Theories: The Case of Defeasible Logic",

abstract = "The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising first order theories. Nonmonotonic reasoning provides rigorous techniques for reasoning with incomplete information. Until recently the dynamics of nonmonotonic reasoning approaches has attracted little attention. This paper studies the dynamics of defeasible logic, a simple and efficient form of nonmonotonic reasoning based on defeasible rules and priorities. We define revision and contraction operators and propose postulates. Our postulates try to follow the ideas of AGM belief revision as far as possible, but some AGM postulates clearly contradict the nonmonotonic nature of defeasible logic, as we explain. Finally we verify that the operators satisfy the postulates.",

keywords = "Intelligent systems, Knowledge representation, Computer circuits",

author = "D. Billington and G. Antoniou and G. Governatori and M. Maher",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 23rd Annual German Conference on Artificial Intelligence, KI 1999 ; Conference date: 13-09-1999 Through 15-09-1999",

year = "1999",

month = sep,

day = "1",

doi = "10.1007/3-540-48238-5_8",

language = "English",

isbn = "3540664955",

volume = "LNCS/LNAI 1701",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "101--112",

editor = "Wolfram Burgard and Cremers, {Armin B.} and Thomas Cristaller",

booktitle = "KI-1999",

address = "Germany",

edition = "1st",

}

Billington, D, Antoniou, G, Governatori, G & Maher, M 1999, Revising Nonmonotonic Theories: The Case of Defeasible Logic. in W Burgard, AB Cremers & T Cristaller (eds), KI-1999: Advances in Artificial Intelligence - 23rd Annual German Conference on Artificial Intelligence Bonn, Germany, September 13–15, 1999 Proceedings. 1st edn, vol. LNCS/LNAI 1701, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1701 LNCS/LNAI, Springer Verlag, Berlin, pp. 101-112, 23rd Annual German Conference on Artificial Intelligence, Bonn, North Rhine-Westphalia, Germany, 13/09/99. https://doi.org/10.1007/3-540-48238-5_8

Revising Nonmonotonic Theories : The Case of Defeasible Logic. / Billington, D.; Antoniou, G.; Governatori, G. et al.

KI-1999: Advances in Artificial Intelligence - 23rd Annual German Conference on Artificial Intelligence Bonn, Germany, September 13–15, 1999 Proceedings. ed. / Wolfram Burgard; Armin B. Cremers; Thomas Cristaller. Vol. LNCS/LNAI 1701 1st. ed. Berlin : Springer Verlag, 1999. p. 101-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1701 LNCS/LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Revising Nonmonotonic Theories

T2 - 23rd Annual German Conference on Artificial Intelligence

AU - Billington, D.

AU - Antoniou, G.

AU - Governatori, G.

AU - Maher, M.

N1 - Conference code: 23

PY - 1999/9/1

Y1 - 1999/9/1

N2 - The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising first order theories. Nonmonotonic reasoning provides rigorous techniques for reasoning with incomplete information. Until recently the dynamics of nonmonotonic reasoning approaches has attracted little attention. This paper studies the dynamics of defeasible logic, a simple and efficient form of nonmonotonic reasoning based on defeasible rules and priorities. We define revision and contraction operators and propose postulates. Our postulates try to follow the ideas of AGM belief revision as far as possible, but some AGM postulates clearly contradict the nonmonotonic nature of defeasible logic, as we explain. Finally we verify that the operators satisfy the postulates.

AB - The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising first order theories. Nonmonotonic reasoning provides rigorous techniques for reasoning with incomplete information. Until recently the dynamics of nonmonotonic reasoning approaches has attracted little attention. This paper studies the dynamics of defeasible logic, a simple and efficient form of nonmonotonic reasoning based on defeasible rules and priorities. We define revision and contraction operators and propose postulates. Our postulates try to follow the ideas of AGM belief revision as far as possible, but some AGM postulates clearly contradict the nonmonotonic nature of defeasible logic, as we explain. Finally we verify that the operators satisfy the postulates.

KW - Intelligent systems

KW - Knowledge representation

KW - Computer circuits

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

UR - https://link.springer.com/book/10.1007/3-540-48238-5

U2 - 10.1007/3-540-48238-5_8

DO - 10.1007/3-540-48238-5_8

M3 - Conference contribution

AN - SCOPUS:78649531441

SN - 3540664955

SN - 9783540664956

VL - LNCS/LNAI 1701

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

SP - 101

EP - 112

BT - KI-1999

A2 - Burgard, Wolfram

A2 - Cremers, Armin B.

A2 - Cristaller, Thomas

PB - Springer Verlag

CY - Berlin

Y2 - 13 September 1999 through 15 September 1999

ER -

Billington D, Antoniou G, Governatori G, Maher M. Revising Nonmonotonic Theories: The Case of Defeasible Logic. In Burgard W, Cremers AB, Cristaller T, editors, KI-1999: Advances in Artificial Intelligence - 23rd Annual German Conference on Artificial Intelligence Bonn, Germany, September 13–15, 1999 Proceedings. 1st ed. Vol. LNCS/LNAI 1701. Berlin: Springer Verlag. 1999. p. 101-112. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48238-5_8

Revising Nonmonotonic Theories: The Case of Defeasible Logic

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this