{"type":"ScholarlyArticle","title":"The Origin of the Binary-Search Paradigm","authors":[{"name":"Zohar Manna","slug":"zohar-manna","given":"Zohar","family":"Manna","affiliation":""},{"name":"Richard J. Waldinger","slug":"richard-j-waldinger","given":"Richard J.","family":"Waldinger","affiliation":""}],"abstract":"In a binary-search algorithm for the computation of a numerical function, the interval in which the desired output is sought is divided in half at each iteration. The paper considers how such algorithms might be derived from their specifications by an automatic program-synthesis system. The derivation of the binarysearch concept has been found to be surprisingly straightforward. The ~rograms obtained, though reasonably simple and efficient, are quite different from those that would have been constructed by informal means.","doi":null,"url":"https://ijcai.org/proceedings/1985/41","pdf":"https://ijcai.org/proceedings/1985/0041.pdf","markdown":"https://ijcai.org/proceedings/1985/41.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/41","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automatic Programming","track":"Automatic Programming","number":41,"pages":{"first":222,"last":223},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}