scientific article; zbMATH DE number 1765660

zbMATH Open0988.68182MaRDI QIDQ4539596FDOQ4539596

Ralf Möller, Volker Haarslev, Michael Wessel

Publication date: 10 July 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2083/20830029

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (11)

• Semantic DMN: Formalizing and Reasoning About Decisions in the Presence of Background Knowledge
• A tableau algorithm for description logics with concrete domains and general TBoxes
• RACCOON: A Connection Reasoner for the Description Logic ALC
• Flexible software architectures for ontology-based information systems
• A tableau decision procedure for \(\mathcal{SHOIQ}\)
• An algebraic view on p-admissible concrete domains for lightweight description logics
• Description logics with concrete domains and general concept inclusions revisited
• Using model theory to find decidable and tractable description logics with concrete domains
• Title not available (Why is that?)
• On the scalability of description logic instance retrieval
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Description logics with concrete domains and general concept inclusions revisited 👍 👎
• Title not available (Why is that?) 👍 👎
• \({\mathcal{ALC}}+T\): a preferential extension of description logics 👍 👎
• \({\mathcal{ALC}_\mathcal{ALC}}\): a context description logic 👍 👎
• A description logic with concrete domains and a role-forming predicate operator 👍 👎
• NEXP TIME-complete description logics with concrete domains 👍 👎
• Title not available (Why is that?) 👍 👎
• Description logics with aggregates and concrete domains. 👍 👎
• Generalized Satisfiability for the Description Logic $\mathcal{ALC}$ 👍 👎

This page was built for publication:

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