Refinement of Conceptual Graphs

Authors:
Juliette Dibie-Barthélemy;Ollivier Haemmerlé;Stéphane Loiseau
Affiliations:
-;-;-
Venue:
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Year:
2001

Citing 8
Cited 1

Conceptual structures: information processing in mind and machine

Conceptual structures: information processing in mind and machine
A theory of diagnosis from first principles

Artificial Intelligence
Detecting and correcting errors in rule-based expert systems: an integration of empirical and explanation-based learning

Knowledge Acquisition
Refinement of knowledge bases based on consistency

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The Representation of Semantic Constraints in Conceptual Graph Systems

ICCS '97 Proceedings of the Fifth International Conference on Conceptual Structures: Fulfilling Peirce's Dream
A Semantic Validation of Conceptual Graphs

ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Checking an expert systems knowledge base for consistency and completeness

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Verification of knowledge bases based on containment checking

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A First Step toward the Knowledge Web: Interoperability Issues among Conceptual Graph Based Software Agents, Part I

ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces

Quantified Score

Hi-index	0.00

Visualization

Abstract

The semantic validation of a knowledge base (KB) consists in checking its quality according to constraints given by an expert. The refinement of a KB consists in correcting the errors that are detected during the validation, in order to restore the KB validity. We propose to perform the semantic validation and refinement of a KB composed of conceptual graphs in two stages. First, we study the coherence of the KB with respect to negative constraints, which represent the knowledge that the KB must not contain. When the KB is not coherent, we propose a solution to correct all the errors of the KB. Second, we study the completeness of the KB with respect to positive constraints, which represent the knowledge that the KB must contain. When the KB is not complete, we propose an assistant, which helps the user to correct the errors of the KB one by one.