Abstract
It is believed by the scientific community that Pℒ1\ and Pℒ2 are the largest concept languages for which there exists a polynomial algorithm that solves the subsumption problem. This is due to Donini, Lenzerini, Nardi, and Nutt, who have presented two tractable algorithms that are intended to solve the subsumption problem in those languages. In contrast, this paper proves that the algorithm for checking subsumption of concepts expressed in the language Pℒ2 is not complete. As a direct consequence, it still remains an open problem to which computational complexity class this subsumption problem belongs.
Cite
CITATION STYLE
Vitória, A., & Mamede, M. (1999). Is Pℒ2 a tractable language? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1695, pp. 90–98). Springer Verlag. https://doi.org/10.1007/3-540-48159-1_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
