{"type":"ScholarlyArticle","title":"A Tractable Class of Abduction Problems","authors":[{"name":"Kave Eshghi","slug":"kave-eshghi","given":"Kave","family":"Eshghi","affiliation":""}],"abstract":"The problem of fmding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Hom theory. In this paper it is shown that when the background theory is acyclic Hom and its pseudo-completion is unit refutable, there is a polynomial time algorithm for fmding minimal explanations. A test for unit-refutability of clausal theories is presented, based on the topology of the connection graph of the theory.","doi":null,"url":"https://ijcai.org/proceedings/1993/1","pdf":"https://ijcai.org/proceedings/1993/0001.pdf","markdown":"https://ijcai.org/proceedings/1993/1.md","bibtex":"https://ijcai.org/proceedings/1993/bibtex/1","volume":{"slug":"1993","title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1993","url":"https://ijcai.org/proceedings/1993/","year":1993,"location":"Chambéry, France","dates":"","editors":"Ruzena Bajcsy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":1,"pages":{"first":3,"last":7},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}