Stratification

The computational base of a system for default reasoning

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

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 languageEnglish
Title of host publicationProceedings Ninth IEEE International Conference on Tools with Artificial Intelligence
PublisherIEEE
Pages165-171
Number of pages7
ISBN (Print)0818682035
DOIs
Publication statusPublished - 1 Dec 1997
Externally publishedYes
Event9th IEEE International Conference on Tools with Artificial Intelligence - Newport Beach, United States
Duration: 3 Nov 19978 Nov 1997
Conference number: 9
https://ieeexplore.ieee.org/xpl/conhome/4999/proceeding

Conference

Conference9th IEEE International Conference on Tools with Artificial Intelligence
CountryUnited States
CityNewport Beach
Period3/11/978/11/97
Internet address

Cite this

Antoniou, G. (1997). Stratification: The computational base of a system for default reasoning. In Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence (pp. 165-171). IEEE. https://doi.org/10.1109/TAI.1997.632251
Antoniou, Grigoris. / Stratification : The computational base of a system for default reasoning. Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. IEEE, 1997. pp. 165-171
@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 = "12",
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",

}

Antoniou, G 1997, Stratification: The computational base of a system for default reasoning. in Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. IEEE, pp. 165-171, 9th IEEE International Conference on Tools with Artificial Intelligence, Newport Beach, United States, 3/11/97. https://doi.org/10.1109/TAI.1997.632251

Stratification : The computational base of a system for default reasoning. / Antoniou, Grigoris.

Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. IEEE, 1997. p. 165-171.

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

TY - GEN

T1 - Stratification

T2 - The computational base of a system for default reasoning

AU - Antoniou, Grigoris

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

SN - 0818682035

SP - 165

EP - 171

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

PB - IEEE

ER -

Antoniou G. Stratification: The computational base of a system for default reasoning. In Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence. IEEE. 1997. p. 165-171 https://doi.org/10.1109/TAI.1997.632251