Search

Examines the Union List of Monographs (ULM) of Israel's Automated Library Expandable Program Hebrew University (ALEPH) in the context of merging algorithms. Merging goals; Merging disparate formats; Developing the merging algorithm; Theory of merging algorithms; Case studies on merging algorithms; Problems in matching and merging methods.

The services provided by libraries should be put at the disposal of users for all their fields of interest. Technology and its electronic processing constituent have passed over the critical level and determine libraries to create systems for access to information and to be efficient. Among these, the OPAC system occupies a central position compared to all the other interest axes. Today, the OPAC system functionalities should be at a real standard level and overpass it by innovating its functions requested, on one hand, by the public who uses highly advanced technologically mobile devices, and, on the other hand, by librarians, when solving the information tasks in an objective manner and develop their own services. The standard functionalities as well as the extended ones belonging to a new generation OPAC system presented in the article represent a necessary benchmark for the librarians interested in developing their own automated library system, as well as by the orientation and development of services, taking into consideration their public and how this public influences and it is influenced by technology and communications, in general. [ABSTRACT FROM AUTHOR]

We report on our implementation of a tableau prover for the description logic ALC, which is based on the EXPTIME tableau algorithm using global caching for ALC that was developed jointly by us and Goré [9]. The prover, called TGC for "Tableaux with Global Caching", checks satisfiability of a set of concepts w.r.t. a set of global assumptions by constructing an and-or graph, using tableau rules for expanding nodes. We have implemented for TGC a special set of optimizations which co-operates very well with global caching and various search strategies. The test results on the test set T98-sat of DL'98 Systems Comparison indicate that TGC is an efficient prover for ALC. This suggests that global caching together with the set of optimizations used for TGC is worth implementing and experimenting also for other modal/description logics. [ABSTRACT FROM AUTHOR]