Abstract: The standard strategies of top-down and bottom-up search are ill-suited to domain specfic logics, and lack flexibility. This paper therefore introduced a binary search strategy, that is analogous to a binary search in an ordered array. We proved this prov

Key words: Logic information system, Binary search, Algorithm, Complexity