Tractable reasoning in description logics with functionality constraints

DOI10.1007/978-3-642-41660-6_8MaRDI QIDQ1799301zbMATH OpenOpenAlexFDO

Authors Andrea Calí, Georg Gottlob, Andreas Pieris

Publication date 18 October 2018

Full work available at URL https://doi.org/10.1007/978-3-642-41660-6_8

Mathematics Subject Classification ID

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

Recommendations

• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Towards more expressive ontology languages: the query answering problem
• Reasoning and query answering in description logics
• Data complexity of query answering in description logics
• Deciding inseparability and conservative extensions in the description logic

Cited in

(7)

• Query inseparability for \(\mathcal{ALC}\) ontologies
• Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
• Inseparability and conservative extensions of description logic ontologies: a survey
• Exploring parallel tractability of ontology materialization
• Tractable reasoning using logic programs with intensional concepts
• On keys and functional dependencies as first-class citizens in description logics
• A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic

This page was built for publication: Tractable reasoning in description logics with functionality constraints

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