Horn knowledge bases in regular description logics with PTime data complexity

MaRDI QIDQ3005913zbMATH OpenFDO

Authors Linh Anh Nguyen

Publication date 10 June 2011

Full work available at URL http://iospress.metapress.com/content/b576480244237043/fulltext.html

zbMATH Keywords

description logics complexitypositive programsregular grammar logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Complexities of Horn description logics
• The data complexity of description logic ontologies
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic $\mathcal{ALC}$
• The Complexity of Conjunctive Query Answering in Expressive Description Logics

Cited in

(4)

• Complexities of Horn description logics
• A Bottom-Up Method for the Deterministic Horn Fragment of the Description Logic $\mathcal{ALC}$
• Model comparison games for Horn description logics
• ExpTime tableau decision procedures for regular grammar logics with converse

This page was built for publication: Horn knowledge bases in regular description logics with PTime data complexity

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