Concept-based Binary Search Algorithm
基于概念的折半查找算法

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 provides more flexibility in the search,while retaining completeness and non-redundancy.We presented a novel algorithm for learning using domain specific logics and binary search,and analysed its complexity.