{"type":"ScholarlyArticle","title":"AND/OR Cutset Conditioning","authors":[{"name":"Robert Mateescu","slug":"robert-mateescu","given":"Robert","family":"Mateescu","affiliation":""},{"name":"Rina Dechter","slug":"rina-dechter","given":"Rina","family":"Dechter","affiliation":""}],"abstract":"Cutset conditioning is one of the methods of solving reasoning tasks for graphical models, especially when space restrictions make inference (e.g., jointree-clustering) algorithms infeasible. The wcutset is a natural extension of the method to a hybrid algorithm that performs search on the conditioning variables and inference on the remaining problems of induced width bounded by w. This paper takes a fresh look at these methods through the spectrum of AND/OR search spaces for graphical models. The resulting AND/OR cutset method is a strict improvement over the traditional one, often by exponential amounts.","doi":null,"url":"https://ijcai.org/proceedings/2005/220","pdf":"https://ijcai.org/proceedings/2005/0220.pdf","markdown":"https://ijcai.org/proceedings/2005/220.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/220","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":220,"pages":{"first":230,"last":234},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}