| Creator |
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
|
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Crossref DOI |
|
| Related DOI |
|
| Related DOI |
|
|
|
|
|
| Related URI |
|
|
|
|
|
| Relation |
|
|
|
|
|
|
|
| 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 h...ave 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.show more
|
Export Mendeley
rifis-tr-18