The properties of deductive systems in Hilbert algebras are treated. If a Hilbert algebra H considered as an ordered set is an upper semilattice then prime deductive systems coincide with meet-irreducible elements of the lattice DedH of all deductive systems on H and every maximal deductive system is prime. Complements and relative complements of DedH are characterized as the so called annihila...

In this paper, we address one important aspect of the problem of designing a cooperative deductive database system, namely, allocation of rules across the deductive database systems. We identify communication cost as the primary consideration in allocation of rules. The problem of optimal allocation of rules has been shown NP-complete, which has prohibitive execution times for large knowledge b...

In order to extend the ability to handle incomplete information in a definite deductive database, a Horn clause based system representing incomplete information as incomplete constants is proposed. By using the notion of incomplete constants the deductive database system handles incomplete information in the form of sets of possible values, thereby giving more information than null values. The ...

Although very important solely supporting the retrieval of single components from a software library is not enough to make e orts towards software reuse a success The DaCapo software library system presented in this paper supports the automatic construction of software from existing com ponents according to a possibly incomplete speci cation Our method adds a global view to conventional single ...

This paper describes a method of the efficient query evaluation when uncertainty is involved in a deductive database system. A deductive system enriched with fuzzy logic is able to serve better as a knowledge system. Speeding up its execution makes this system practically useful.

The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. This paper studies a deductive inference method for PC(ID), its propositional fragment. We introduce a formal proof system based on the sequent calculus (Gentzen-style deductive system) for this logic. As PC(ID) is an integration of classical propositional logic a...

This article will introduce abductive case-based reasoning (CBR) and attempt to show that abductive CBR and deductive CBR can be integrated in clinical process and problem solving. Then it provides a unified formalization for integration of abduction, abductive CBR, deduction and deductive CBR. This article also investigates abductive case retrieval and deductive case retrieval using similarity...