{"type":"ScholarlyArticle","title":"Constrained and Rational Default Logics","authors":[{"name":"Artur Mikitiuk","slug":"artur-mikitiuk","given":"Artur","family":"Mikitiuk","affiliation":""},{"name":"Miroslaw Truszczynski","slug":"miroslaw-truszczynski","given":"Miroslaw","family":"Truszczynski","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1995/195","pdf":"https://ijcai.org/proceedings/1995/0195.pdf","markdown":"https://ijcai.org/proceedings/1995/195.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/195","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Non-monotonic Reasoning","track":"Non-monotonic Reasoning","number":195,"pages":{"first":1509,"last":1516},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}