A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic \mathcal{ALC}

DOI10.1007/11853886_29MaRDI QIDQ3533144zbMATH OpenOpenAlexFDO

Authors Linh Anh Nguyen

Publication date 30 October 2008

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11853886_29

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5295720
• Horn knowledge bases in regular description logics with PTime data complexity
• PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
• Generalized satisfiability for the description logic \(\mathcal{ALC}\)
• Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$

Cited in

(2)

• Horn knowledge bases in regular description logics with PTime data complexity
• Model comparison games for Horn description logics

This page was built for publication: A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic $\mathcal{ALC}$

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