Constrained and Rational Default Logics
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Non-monotonic Reasoning. Pages 1509-1516.
Abstract
In this paper we consider constrained and rational default logics. We provide two characterizations of constrained extensions. One of them is used to derive complexity results for decision problems involving constrained extensions. In particular, we show that the problem of membership of a formula in at least one (in all) constrained extension(s) of a default theory is :Ef -complete (IIf -complete). We establish the relationship between constrained and rational default logics. We prove that rational extensions determine constrained extensions and that for seminormal default theories there is a one-to-one correspondence between these objects. We also show that the definition of a constrained extension can be extended to cover the case of default theories which may contain justification-free defaults.
@inproceedings{ijcai1995p195,
title = {Constrained and Rational Default Logics},
author = {Mikitiuk, Artur and Truszczynski, Miroslaw},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1509--1516},
year = {1995},
note = {Non-monotonic Reasoning},
url = {https://ijcai.org/proceedings/1995/195},
}
TY - CPAPER TI - Constrained and Rational Default Logics AU - Mikitiuk, Artur AU - Truszczynski, Miroslaw T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1509 EP - 1516 UR - https://ijcai.org/proceedings/1995/195 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
