Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Lemanski, J. (2018). Calculus CL as ontology editor and inference engine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10871 LNAI, pp. 752–756). Springer Verlag. https://doi.org/10.1007/978-3-319-91376-6_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
