Document Type
Conference Proceeding
Publication Date
9-10-2012
Abstract
We present a tableau algorithm for the description logic ALCOV. This description logic is obtained by extending the description logic ALCO with the expressive nominal schema construct that enables DL-safe datalog with predicates of arbitrary arity to be covered within the description logic framework. The tableau algorithm provides a basis to implement a delayed grounding strategy which was not facilitated by earlier versions of decision procedures for satisfiability in expressive description logics with nominal schemas.
Repository Citation
Krisnadhi, A.,
& Hitzler, P.
(2012). A Tableau Algorithm for Description Logics with Nominal Schema. Lecture Notes in Computer Science, 7497, 234-237.
https://corescholar.libraries.wright.edu/cse/59
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
This paper was presented at the 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012.
The featured PDF document is the unpublished, peer-reviewed version of this article.
The featured abstract was published in the final version of this article, which appeared in Lecture Notes in Computer Science, volume 7497 pp. 234-237 and may be found at http://link.springer.com/chapter/10.1007%2F978-3-642-33203-6_22 .