Matching in the Description Logic FL0 with respect to General TBoxes

DOI10.29007/Q74PzbMATH Open1415.68216OpenAlexW2908105614MaRDI QIDQ5222946FDOQ5222946

Authors Franz Baader, Oliver Fernández Gil, Pavlos Marantidis 

Publication date 4 July 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/q74p

zbMATH Keywords

matchingcomplexitydescription logictree automata

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 1222700
• Matching in description logics
• Approximate unification in the description logic \(\mathcal {FL}_0\)
• A tableau algorithm for description logics with concrete domains and general TBoxes
• Extending the description logic \(\tau\mathcal{EL}(\deg)\) with acyclic TBoxes
• scientific article; zbMATH DE number 6902582
• Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
• Reasoning About Actions Using Description Logics with General TBoxes
• scientific article; zbMATH DE number 1765662

Cited In (4)

• Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
• Title not available (Why is no real title available?)
• Extensions of unification modulo ACUI
• Efficient TBox Reasoning with Value Restrictions—Introducing the $$\mathcal {F\!L}_{o}{} \textit{wer}$$ Reasoner

This page was built for publication: Matching in the Description Logic FL0 with respect to General TBoxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222946)