Document - A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}

2019

Journal article Open Access

A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure

Casini G., Straccia U., Meyer T.

Non-Monotonic Logic Computer Science Applications Rational Closure Artificial Intelligence Theoretical Computer Science Description Logics Software Information Systems and Management Control and Systems Engineering

Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe \ELObot, a notable and practically important DL representative of the OWL 2 profile OWL 2 EL. Our contribution here is to define a polynomial time subsumption procedure for nominal safe \ELObot~under RC that relies entirely on a series of classical, monotonic \ELbot~subsumption tests. Therefore, any existing classical monotonic \ELbot~reasoner can be used as a black box to implement our method. We then also adapt the method to one of the known extensions of RC for DLs, namely Defeasible Inheritance-based DLs without losing the computational tractability.

Source: Information sciences 501 (2019): 588–620. doi:10.1016/j.ins.2018.09.037

Publisher: Elsevier [etc.], Boston [etc.], Paesi Bassi

Metrics

Back to previous page

Cite as

BibTeX entry

@article{oai:it.cnr:prodotti:405194,
	title = {A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure},
	author = {Casini G. and Straccia U. and Meyer T.},
	publisher = {Elsevier [etc.], Boston [etc.], Paesi Bassi},
	doi = {10.1016/j.ins.2018.09.037},
	journal = {Information sciences},
	volume = {501},
	pages = {588–620},
	year = {2019}
}