|
|
|
The accent of
the research has been on questions 1, 2 and 3. A lot of puzzling was
necessary before finding a convenient structure for the inferencing engine.
The search for the proof of the soundness and completeness of the results of
the engine required a deal of work too. The study and comparison of different
logics in relation to RDF involved also a fair amount of theoretical work.
|
|
I will again
review the questions and mention what was accomplished during the research:
|
|
1) define an inference process on top
of RDF and give a specification of
this process in a functional language.
|
|
A program with different versions was
written and tested.
|
|
2) is the
specified inference process sound and complete?
|
|
A graph theory is established that
proofs the soundness and completeness of
the engine and leads to two applications (deduction of a proof of a
solution and deduction of a general rule)
|
|
3) which kind of logic is best suited
for the Semantic Web?
|
|
It is shown that RDF with an implication as
defined in the thesis uses constructive logic. The use of constructive logic
is defended for the Semantic Web.
|
|
4) what can be done for augmenting the
efficiency of the inference process?
|
|
Experiments were done with two
optimization techniques and some others were discussed.
|
|
5) how can inconsistencies be
handled by the inference process?
|
|
The importance of logic for the
handling and avoidance of inconsistencies is pointed out. Some theoretic
aspects of inconsistency are highlighted.
|
|
|
|
|
|
|