摘要
自顶向下或自底向上两种标准查找方式不适合于具体领域逻辑,且缺乏灵活性。模拟有序数组中的折半查找,提出逻辑空间上的折半查找方法,证明该查找方法在保持完备性和非冗余性的同时,还提供了更好的灵活性,最后给出了该查找的通用算法,并分析其复杂性。
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.
出处
《计算机科学》
CSCD
北大核心
2009年第6期235-238,共4页
Computer Science
关键词
逻辑信息系统
折半查找
算法
复杂性
Logic information system, Binary search, Algorithm, Complexity
