Calculus CL as Ontology Editor and Inference Engine

The paper outlines the advantages and limits of the so-called ‘Calculus CL’ in the field of ontology engineering and automated theorem proving. CL is a diagram type that combines features of tree, Euler-type, Venn-type diagrams and squares of opposition. Due to the simple taxonomical structures and...

Full description

Saved in:
Bibliographic Details
Published inDiagrammatic Representation and Inference Vol. 10871; pp. 752 - 756
Main Author Lemanski, Jens
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN9783319913759
3319913751
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-91376-6_74

Cover

Loading…
More Information
Summary:The paper outlines the advantages and limits of the so-called ‘Calculus CL’ in the field of ontology engineering and automated theorem proving. CL is a diagram type that combines features of tree, Euler-type, Venn-type diagrams and squares of opposition. Due to the simple taxonomical structures and intuitive rules of CL, it is easy to edit ontologies and to prove inferences.
ISBN:9783319913759
3319913751
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-91376-6_74