@article{oai:kyutech.repo.nii.ac.jp:00006406,
 author = {Sakai, H and 酒井, 浩},
 issue = {1-2},
 journal = {Bulletin of Informatics and Cybernetics},
 month = {Mar},
 note = {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 incompleteness. In or-type knowledge bases, the predicate symbols are only restricted to or m, where the superscript m implies the arity, and any disjunctive information is included in a predicate as arguments. The two systems are naturally defined for the incompleteness of the disjunctive information. The one is a Box-system, 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 developed 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 question-answering in an or-type knowledge base by a realized prover.},
 pages = {27--37},
 title = {Completeness of Diamond-Resolution in Or-Type Knowledge Bases},
 volume = {24},
 year = {1990},
 yomi = {サカイ, ヒロシ}
}