Abstract properties for the choice provability relation in nonmonotonic logics

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

Abstract

We analyze the relationship between choice provability (derivability in at least one extension) of nonmonotonic logics, and the abstract properties of nonmonotonic inference relations proposed in the literature. We show that choice provability in default, autoepistemic and even cumulative default logic does not satisfy most of these properties. This is not accidental, but lies at the heart of choice provability, as far as formula-manipulating logics are concerned: Any such logic respecting some natural conditions has a noncumulative choice provability relation. In contrast to this result, we show that choice provability in the logic L1 recently introduced by Brewka is cumulative. This is possible because L1 manipulates defaults and not formulas.

Original languageEnglish
Title of host publicationAdvances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings
EditorsPietro Torasso
PublisherSpringer Verlag
Pages35-40
Number of pages6
ISBN (Print)9783540572923
Publication statusPublished - 1 Jan 1993
Externally publishedYes
Event3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993 - Torino, Italy
Duration: 26 Oct 199328 Oct 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume728 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993
CountryItaly
CityTorino
Period26/10/9328/10/93

Fingerprint

Nonmonotonic Logic
Logic
Default Logic

Cite this

Antoniou, G. (1993). Abstract properties for the choice provability relation in nonmonotonic logics. In P. Torasso (Ed.), Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings (pp. 35-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 728 LNAI). Springer Verlag.
Antoniou, Grigoris. / Abstract properties for the choice provability relation in nonmonotonic logics. Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings. editor / Pietro Torasso . Springer Verlag, 1993. pp. 35-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{408c785ba9f14260aeb10d14a90913f9,
title = "Abstract properties for the choice provability relation in nonmonotonic logics",
abstract = "We analyze the relationship between choice provability (derivability in at least one extension) of nonmonotonic logics, and the abstract properties of nonmonotonic inference relations proposed in the literature. We show that choice provability in default, autoepistemic and even cumulative default logic does not satisfy most of these properties. This is not accidental, but lies at the heart of choice provability, as far as formula-manipulating logics are concerned: Any such logic respecting some natural conditions has a noncumulative choice provability relation. In contrast to this result, we show that choice provability in the logic L1 recently introduced by Brewka is cumulative. This is possible because L1 manipulates defaults and not formulas.",
author = "Grigoris Antoniou",
year = "1993",
month = "1",
day = "1",
language = "English",
isbn = "9783540572923",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "35--40",
editor = "{Torasso }, Pietro",
booktitle = "Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings",

}

Antoniou, G 1993, Abstract properties for the choice provability relation in nonmonotonic logics. in P Torasso (ed.), Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 728 LNAI, Springer Verlag, pp. 35-40, 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Torino, Italy, 26/10/93.

Abstract properties for the choice provability relation in nonmonotonic logics. / Antoniou, Grigoris.

Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings. ed. / Pietro Torasso . Springer Verlag, 1993. p. 35-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 728 LNAI).

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

TY - GEN

T1 - Abstract properties for the choice provability relation in nonmonotonic logics

AU - Antoniou, Grigoris

PY - 1993/1/1

Y1 - 1993/1/1

N2 - We analyze the relationship between choice provability (derivability in at least one extension) of nonmonotonic logics, and the abstract properties of nonmonotonic inference relations proposed in the literature. We show that choice provability in default, autoepistemic and even cumulative default logic does not satisfy most of these properties. This is not accidental, but lies at the heart of choice provability, as far as formula-manipulating logics are concerned: Any such logic respecting some natural conditions has a noncumulative choice provability relation. In contrast to this result, we show that choice provability in the logic L1 recently introduced by Brewka is cumulative. This is possible because L1 manipulates defaults and not formulas.

AB - We analyze the relationship between choice provability (derivability in at least one extension) of nonmonotonic logics, and the abstract properties of nonmonotonic inference relations proposed in the literature. We show that choice provability in default, autoepistemic and even cumulative default logic does not satisfy most of these properties. This is not accidental, but lies at the heart of choice provability, as far as formula-manipulating logics are concerned: Any such logic respecting some natural conditions has a noncumulative choice provability relation. In contrast to this result, we show that choice provability in the logic L1 recently introduced by Brewka is cumulative. This is possible because L1 manipulates defaults and not formulas.

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

M3 - Conference contribution

SN - 9783540572923

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

SP - 35

EP - 40

BT - Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings

A2 - Torasso , Pietro

PB - Springer Verlag

ER -

Antoniou G. Abstract properties for the choice provability relation in nonmonotonic logics. In Torasso P, editor, Advances in Artificial Intelligence - 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA 1993, Proceedings. Springer Verlag. 1993. p. 35-40. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).