{"type":"ScholarlyArticle","title":"Sampling Combinatorial Spaces Using Biased Random Walks","authors":[{"name":"Jordan Erenrich","slug":"jordan-erenrich","given":"Jordan","family":"Erenrich","affiliation":""},{"name":"Bart Selman","slug":"bart-selman","given":"Bart","family":"Selman","affiliation":""}],"abstract":"For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can state-of-the-art search procedures for SAT be used to sample effectively from the space of all solutions? And, if so, how uniformly do they sample? Our initial results find that on the positive side, one can find all solutions to a given instance. Nevertheless, sampling can be highly biased. This research provides a starting point for the development of more balanced procedures.","doi":null,"url":"https://ijcai.org/proceedings/2003/204","pdf":"https://ijcai.org/proceedings/2003/0204.pdf","markdown":"https://ijcai.org/proceedings/2003/204.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/204","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":204,"pages":{"first":1376,"last":1379},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}