{"type":"ScholarlyArticle","title":"Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases","authors":[{"name":"Sylvie Coste-Marquis","slug":"sylvie-coste-marquis","given":"Sylvie","family":"Coste-Marquis","affiliation":""},{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":""}],"abstract":"","doi":null,"url":"https://ijcai.org/proceedings/1999/4","pdf":"https://ijcai.org/proceedings/1999/0004.pdf","markdown":"https://ijcai.org/proceedings/1999/4.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/4","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":null,"track":"","number":4,"pages":{"first":null,"last":null},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}