Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL_0

Research output: Contribution to book/conference proceedings/anthology/reportConference contributionInvited

Contributors

Details

Original languageEnglish
Title of host publication11th International Conference on Language and Automata Theory and Applications, LATA 2017
PublisherSpringer, Berlin [u. a.]
Pages3-26
Number of pages24
Publication statusPublished - 2017
Peer-reviewedNo

Publication series

SeriesLecture Notes in Computer Science, Volume 10168
ISSN0302-9743

Conference

Title11th International Conference on Language and Automata Theory and Applications
Abbreviated titleLATA 2017
Conference number11
Duration6 - 9 March 2017
CityUmeå
CountrySweden

External IDs

Scopus 85013384791
ORCID /0000-0002-4049-221X/work/142247926

Keywords

Library keywords