Skeptical rational extensions

Artur Mikitiuk; Miroslaw Truszczyński

doi:10.1007/3-540-59487-6_19

Skeptical rational extensions

Artur Mikitiuk, Miroslaw Truszczyński

Computer Science

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

1 Scopus citations

Abstract

In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justifications are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extension. We give characterization results for skeptical rational extensions and an algorithm to compute them. We present some complexity results. Our main goal is to characterize cases when the class of skeptical rational extensions is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings
Editors	V. Wiktor Marek, Miroslaw Truszczynski, Anil Nerode
Pages	259-272
Number of pages	14
DOIs	https://doi.org/10.1007/3-540-59487-6_19
State	Published - 1995
Event	3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995 - Lexington, United States Duration: Jun 26 1995 → Jun 28 1995

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	928
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995
Country/Territory	United States
City	Lexington
Period	6/26/95 → 6/28/95

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-59487-6_19

Cite this

Mikitiuk, A., & Truszczyński, M. (1995). Skeptical rational extensions. In V. W. Marek, M. Truszczynski, & A. Nerode (Eds.), Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings (pp. 259-272). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 928). https://doi.org/10.1007/3-540-59487-6_19

Mikitiuk, Artur ; Truszczyński, Miroslaw. / Skeptical rational extensions. Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings. editor / V. Wiktor Marek ; Miroslaw Truszczynski ; Anil Nerode. 1995. pp. 259-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6534bae124bf4881bffcce3aab7fe601,

title = "Skeptical rational extensions",

abstract = "In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justifications are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extension. We give characterization results for skeptical rational extensions and an algorithm to compute them. We present some complexity results. Our main goal is to characterize cases when the class of skeptical rational extensions is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.",

author = "Artur Mikitiuk and Miroslaw Truszczy{\'n}ski",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995 ; Conference date: 26-06-1995 Through 28-06-1995",

year = "1995",

doi = "10.1007/3-540-59487-6_19",

language = "English",

isbn = "9783540594871",

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

pages = "259--272",

editor = "Marek, {V. Wiktor} and Miroslaw Truszczynski and Anil Nerode",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings",

}

Mikitiuk, A & Truszczyński, M 1995, Skeptical rational extensions. in VW Marek, M Truszczynski & A Nerode (eds), Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 928, pp. 259-272, 3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995, Lexington, United States, 6/26/95. https://doi.org/10.1007/3-540-59487-6_19

Skeptical rational extensions. / Mikitiuk, Artur; Truszczyński, Miroslaw.
Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings. ed. / V. Wiktor Marek; Miroslaw Truszczynski; Anil Nerode. 1995. p. 259-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 928).

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

TY - GEN

T1 - Skeptical rational extensions

AU - Mikitiuk, Artur

AU - Truszczyński, Miroslaw

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1995.

PY - 1995

Y1 - 1995

N2 - In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justifications are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extension. We give characterization results for skeptical rational extensions and an algorithm to compute them. We present some complexity results. Our main goal is to characterize cases when the class of skeptical rational extensions is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.

AB - In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justifications are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extension. We give characterization results for skeptical rational extensions and an algorithm to compute them. We present some complexity results. Our main goal is to characterize cases when the class of skeptical rational extensions is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.

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

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

U2 - 10.1007/3-540-59487-6_19

DO - 10.1007/3-540-59487-6_19

M3 - Conference contribution

AN - SCOPUS:84947997362

SN - 9783540594871

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

SP - 259

EP - 272

BT - Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings

A2 - Marek, V. Wiktor

A2 - Truszczynski, Miroslaw

A2 - Nerode, Anil

T2 - 3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995

Y2 - 26 June 1995 through 28 June 1995

ER -

Mikitiuk A, Truszczyński M. Skeptical rational extensions. In Marek VW, Truszczynski M, Nerode A, editors, Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings. 1995. p. 259-272. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-59487-6_19

Skeptical rational extensions

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this