{"type":"ScholarlyArticle","title":"On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases","authors":[{"name":"Robert Baumgartner","slug":"robert-baumgartner","given":"Robert","family":"Baumgartner","affiliation":""},{"name":"Georg Gottlob","slug":"georg-gottlob","given":"Georg","family":"Gottlob","affiliation":""}],"abstract":"We analyse the complexity of standard and weak model checking for propositional default logic; in particular, we solve the open problem of complexity in case of normal default theories and introduce a new ample class of default theories with a tractable model checking problem.","doi":null,"url":"https://ijcai.org/proceedings/1999/10","pdf":"https://ijcai.org/proceedings/1999/0010.pdf","markdown":"https://ijcai.org/proceedings/1999/10.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/10","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":10,"pages":{"first":64,"last":68},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}