%0 Journal Article
%T Concept-based Binary Search Algorithm<br>基于概念的折半查找算法
%A SHI Bai-sheng
%A <br>时百胜
%J 计算机科学
%D 2009
%I 
%X 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.
%K Logic information system
%K Binary search
%K Algorithm
%K Complexity<br>逻辑信息系统
%K 折半查找
%K 算法
%K 复杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=7D9B8CB4B40882B612FFECD1237D28A2&yid=DE12191FBD62783C&vid=933658645952ED9F&iid=B31275AF3241DB2D&sid=6CCE24D86D03D083&eid=9CA95D22FC1D537C&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=6