{"type":"ScholarlyArticle","title":"Results on Translating Defaults to Circumscription","authors":[{"name":"Tomasz Imielinski","slug":"tomasz-imielinski","given":"Tomasz","family":"Imielinski","affiliation":""}],"abstract":"In this !Japer w•· define differ<·nt concept• of translating a set of defaults into circumscription. The most important of thesemodular translation requires that the additive changes of specific facts (not defaults) of default theory translate to the additive changes of the simple abnormality theory (corresponding to circumscription) . We show that , surprisingly enough, the important class of defaults, normal defaults with prerequisites , do not have such a. modular translation into circumscription (abnormality theory). We also establish the classes of defaults which are translatable into circumscription. For example we show that arbitrary combination (ordered combination) of seminormal defaults without prerequisites can be modularly translated into circumscription.","doi":null,"url":"https://ijcai.org/proceedings/1985/21","pdf":"https://ijcai.org/proceedings/1985/0021.pdf","markdown":"https://ijcai.org/proceedings/1985/21.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/21","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":21,"pages":{"first":114,"last":119},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}