engleski

Logical Consequences in Partial Knowledge Bases

In this paper, we consider logical consequences for reasoning about functional, multivalued, and join dependencies in partial knowledge bases. The standard consequence, strong consequence, and the weak consequence are characterized. We prove that reasoning based on the standard logical consequence is equivalent to reasoning based on the strong logical consequence. In addition, we prove that reasoning based on the standard logical consequence and reasoning based on the weak logical consequence are not equivalent. We also define a formal system FSED for reasoning about existence dependencies. We prove that the formal system FSED is sound and complete. We state the connection between existence and functional dependencies: reasoning about existence dependencies based on the corresponding logical consequence and reasoning about functional dependencies based on the standard logical consequence are equivalent.

partial knowledge bases ; dependencies ; logical consequences ; formal systems ; inference rules ; soundness ; completeness

nije evidentirano