نتایج جستجو برای: منطق order sorted

تعداد نتایج: 923770  

Journal: :Theoretical Computer Science 1997

1994
Manfred Kerber

Extending existing calculi by sorts is a strong means for improving the deductive power of rst-order theorem provers. Since many mathematical facts can be more easily expressed in higher-order logic { aside the greater power of higher-order logic in principle {, it is desirable to transfer the advantages of sorts in the rst-order case to the higher-order case. One possible method for automating...

Journal: :Transactions of the Japanese Society for Artificial Intelligence 2005

Journal: :SIAM J. Comput. 2000
Arne Andersson Torben Hagerup Johan Håstad Ola Petersson

Given a k-character query string and an array of n strings arranged in lexicographical order, computing the rank of the query string among the n strings or deciding whether it occurs in the array requires the inspection of k log logn log log (4 + k log log n logn ) + k + logn ! characters in the worst case.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید