{"type":"ScholarlyArticle","title":"Diagnosing Tree-Decomposable Circuits","authors":[{"name":"Yousri El Fattah","slug":"yousri-el-fattah","given":"Yousri El","family":"Fattah","affiliation":""},{"name":"Rina Dechter","slug":"rina-dechter","given":"Rina","family":"Dechter","affiliation":""}],"abstract":"This paper describes a diagnosis algorithm called structure-based abduction (SAB) which was developed in the framework of constraint networks [12]. The algorithm exploits the structure of the constraint network and is most efficient for near-tree problem domains. By analyzing the structure of the problem domain, the performance of such algorithms c~n be bounded in advance. We present empirical results comparing SAB with two modelbased algorithms, MBD1 and MBD2, for the task of finding one or all minimal-cardinality diagnoses . MBD1 uses the same computing strategy as algorithm GDE [9]. MBD2 adopts a breadth-first search strategy similar to the algorithm DIAGNOSE [24]. The main conclusion is that for nearly acyclic circuits, such as theN-bit adder, the performance of SAB being linear provides definite advantages as the size of the circuit increases.","doi":null,"url":"https://ijcai.org/proceedings/1995/224","pdf":"https://ijcai.org/proceedings/1995/0224.pdf","markdown":"https://ijcai.org/proceedings/1995/224.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/224","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Qualitative Reasoning and Diagnosis","track":"Qualitative Reasoning and Diagnosis","number":224,"pages":{"first":1742,"last":1748},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}