Stratification: The computational base of a system for default reasoning

Grigoris Antoniou

doi:10.1109/TAI.1997.632251

Stratification: The computational base of a system for default reasoning

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

Abstract

Default reasoning is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, `local' way. Up to now this idea was only followed for Reiter's default logic, yet it is also relevant to other variants of default logic which have found increasing recognition in the past years. This paper shows how it can be modified to work for several popular, alternative approaches of default reasoning: Justified, Constrained and Rational Default Logic. This work defines the formal basis for a Web-based default reasoning system which is under development at our institution.

Original language	English
Title of host publication	Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence
Publisher	IEEE
Pages	165-171
Number of pages	7
ISBN (Print)	0818682035
DOIs	https://doi.org/10.1109/TAI.1997.632251
Publication status	Published - 1 Dec 1997
Externally published	Yes
Event	9th IEEE International Conference on Tools with Artificial Intelligence - Newport Beach, United States Duration: 3 Nov 1997 → 8 Nov 1997 Conference number: 9 https://ieeexplore.ieee.org/xpl/conhome/4999/proceeding

Conference

Conference	9th IEEE International Conference on Tools with Artificial Intelligence
Country/Territory	United States
City	Newport Beach
Period	3/11/97 → 8/11/97
Internet address	https://ieeexplore.ieee.org/xpl/conhome/4999/proceeding

Access to Document

10.1109/TAI.1997.632251Licence: Unspecified

Cite this

@inproceedings{54551159014c495096960ea65cb77a42,

title = "Stratification: The computational base of a system for default reasoning",

abstract = "Default reasoning is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, `local' way. Up to now this idea was only followed for Reiter's default logic, yet it is also relevant to other variants of default logic which have found increasing recognition in the past years. This paper shows how it can be modified to work for several popular, alternative approaches of default reasoning: Justified, Constrained and Rational Default Logic. This work defines the formal basis for a Web-based default reasoning system which is under development at our institution.",

author = "Grigoris Antoniou",

year = "1997",

month = dec,

day = "1",

doi = "10.1109/TAI.1997.632251",

language = "English",

isbn = "0818682035",

pages = "165--171",

booktitle = "Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence",

publisher = "IEEE",

address = "United States",

note = "9th IEEE International Conference on Tools with Artificial Intelligence ; Conference date: 03-11-1997 Through 08-11-1997",

url = "https://ieeexplore.ieee.org/xpl/conhome/4999/proceeding",

}

TY - GEN

T1 - Stratification

T2 - 9th IEEE International Conference on Tools with Artificial Intelligence

AU - Antoniou, Grigoris

N1 - Conference code: 9

PY - 1997/12/1

Y1 - 1997/12/1

N2 - Default reasoning is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, `local' way. Up to now this idea was only followed for Reiter's default logic, yet it is also relevant to other variants of default logic which have found increasing recognition in the past years. This paper shows how it can be modified to work for several popular, alternative approaches of default reasoning: Justified, Constrained and Rational Default Logic. This work defines the formal basis for a Web-based default reasoning system which is under development at our institution.

AB - Default reasoning is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, `local' way. Up to now this idea was only followed for Reiter's default logic, yet it is also relevant to other variants of default logic which have found increasing recognition in the past years. This paper shows how it can be modified to work for several popular, alternative approaches of default reasoning: Justified, Constrained and Rational Default Logic. This work defines the formal basis for a Web-based default reasoning system which is under development at our institution.

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

U2 - 10.1109/TAI.1997.632251

DO - 10.1109/TAI.1997.632251

M3 - Conference contribution

AN - SCOPUS:0031341361

SN - 0818682035

SP - 165

EP - 171

BT - Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence

PB - IEEE

Y2 - 3 November 1997 through 8 November 1997

ER -

Stratification: The computational base of a system for default reasoning

Abstract

Conference

Access to Document

Other files and links

Cite this