Maxim Lifantsev

Learn More
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a formidable data manipulation challenge. We present a general technique for efficiently carrying out large sets of simple transformation or querying operations over external-memory(More)
We present a new precedence-based termination ordering for (polymorphic) higher-order terms without-abstraction. The ordering has been designed to strictly generalize the lexicographic path ordering (on rst-order terms). It is relatively simple, but can be used to prove termination of many higher-order rewrite systems, especially those corresponding to(More)
Yuntis is a fully-functional prototype of a complete web search engine with features comparable to those available in commercial-grade search engines. In particular , Yuntis supports page quality scoring based on global web linkage graph, extensively exploits text associated with links, computes pages' keywords and lists of similar pages of good quality,(More)
We use the notion of the rough set diagram introduced by Wasilewska and Vigneron 8] to present a general decision procedure for validity of equations in rough boolean algebra. First, we establish equivalence of validity in rough boolean algebra to validity in so called simple rough boolean algebra. Second, we propose a decision method for simple rough(More)
This article describes a generalization of term rewriting system technique used as a basis for decision algorithm for equational theories. The or-deral term rewriting system technique is presented. The main innovation of the proposed technique is that reductions according to some rules of such a system are performed only if special restrictions are(More)
  • 1