Abstract
The framework of the or-type knowledge base is proposed to deal with disjunctive information in knowledge bases. Recently, it is an important problem how effectively we use information which may have some incomplete ness. In or-type knowledge bases, the predicate symbols are only restricted to orm, where the superscript m implies the arity, and any disjunctive infor mation is included in a predicate as arguments. The two systems are naturally defined for the incompleteness of the disjunctive information. The one is a Boxsystem, where the incompleteness does not influence the deduction and the refutation. The other is a Diamond system, where the incompleteness influences them. We have already devel oped the fixpoint theorem and the completeness of resolution in the Box system. In this paper, we show the fixpoint theorem, and the completeness of resolution in the Diamond-system. Furthermore, we present an actual ques tionanswering in an or-type knowledge base by a realized prover.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
