In our distributed information system, two information structures are maintained--the application database and the database used to route queries in the computer network. We introduce a class of routing tables and show their use in the search process within the computer network. Any site of a distributed information system which is unable to answer a query has to search for a site which can answer it. The information stored in routing tables has a strong impact on the speed of this search. It is proposed that each site learns new facts from each of its neighbors. These new facts are compiled into rules and used to build knowledge bases at all sites of a distributed information system. This extended distributed information system is called a distributed knowledge-based system. The main goal of this paper is to suggest a strategy for reconstruction of collapsed application databases and collapsed routing tables.