{"type":"ScholarlyArticle","title":"Skeptical Inheritance: Computing the Intersection of Credulous Extensions","authors":[{"name":"Lynn Andrea Stein","slug":"lynn-andrea-stein","given":"Lynn Andrea","family":"Stein","affiliation":""}],"abstract":"Ideally skeptical inheritance supports exactly those inferences true in every credulous extension of an inheritance hierarchy. We provide a formal definition of ideally skeptical inheritance. We show that two path -based approaches fail to capture ideally skeptical inheritance, and that there are inheritance hierarchies for which there are more always-true inferences than always-supported paths. We describe an ATMS-like scheme that computes ideally skeptical inheritance and represents hierarchical dependencies using a limited form of Boolean satisfiability. Finally, we demonstrate a preemption (specificity) strategy for which ideally skeptical inheritance is polynomial-time computable.","doi":null,"url":"https://ijcai.org/proceedings/1989/185","pdf":"https://ijcai.org/proceedings/1989/0185.pdf","markdown":"https://ijcai.org/proceedings/1989/185.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/185","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Commonsense Reasoning","track":"Commonsense Reasoning","number":185,"pages":{"first":1153,"last":1159},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}