Proceedings

The Origin of the Binary-Search Paradigm

Download BibTeX Cite

Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 222-223.

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.

Zohar Manna, and Richard J. Waldinger. 1985. The Origin of the Binary-Search Paradigm. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 222–223. https://ijcai.org/proceedings/1985/41
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards