Deciding the ALCNIR+-Satisfiability with a Fully Tiered Clause

Article Preview

Abstract:

In contrast with Tableau algorithm, this paper presented a totally new approach to check the satisfiabilities of acyclic ALCNIR+-concepts―FTC algorithm. This calculus can make a direct judgment on the satisfiability of an acyclic ALCNIR+-concept by translating its description into a fully tiered clause whose satisfiability is directly available. FTC algorithm eliminates description overlaps to largest extent as it works on concept description directly. Therefore, FTC algorithm has notably better performance than Tableaux by saving a lot of spatial costs.

You might also be interested in these eBooks

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Pages:

1337-1342

Citation:

Online since:

June 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] U. Hustadt, B. Motik, U. Sattler: Reasoning in Description Logics by a Reduction to Disjunctive Datalog. Journal of Automated Reasoning, Vol. 39(2007), pp.351-384.

DOI: 10.1007/s10817-007-9080-3

Google Scholar

[2] H. W. Christian, P. Bijan, S. Evren. Description logic reasoning with syntactic updates. In: Meersman, R, Tari Z, eds. The 5th international conference on ontologies, databases, and applications of semantics (odbase2006). LNCS 4275, Berlin/Heidelberg: Springer (2006).

Google Scholar

[3] I. Horrocks, U. Sattler: Ontology reasoning in the SHOQ(D) description logic. In: Bernhard N, eds. Proc. of IJCAI 2001, San Francisco: Morgan Kaufmann (2001), pp.199-204.

Google Scholar

[4] I. Horrocks, U. Sattler: A Tableau Decision Procedure for SHOIQ. Journal of Automated Reasoning, Vol. 39(2007), pp.249-276.

DOI: 10.1007/s10817-007-9079-9

Google Scholar

[5] T. Liebig, F. Müller: Parallelizing Tableaux-Based Description Logic Reasoning. Meersman R, , edited by Z. Tari, P. Herrero, et al. On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops. LNCS 4806. Berlin/Heidelberg: Springer (2007).

DOI: 10.1007/978-3-540-76890-6_41

Google Scholar

[6] J. Bao, D. Caragea, V. Honavar. A Distributed Tableau Algorithm for Package-based Description Logics. In: Ghidini C, Serafini L, Bouquet P, eds. Proceedings of the ECAI Workshop on Context Representation and Reasoning , Riva del Garda, Italy (2006).

Google Scholar

[7] L. Chang, Z. Z. Shi, L. R. Qiu, F. Lin. A Tableau Decision Algorithm for Dynamic Description Logic. Chinese Journal of Computers, Vol. 31(2008), pp.896-909 (In Chinese).

DOI: 10.3724/sp.j.1016.2008.00896

Google Scholar

[8] Y. C. Jiang, Z. Z. Shi, Y. Tang, J. Wang: Fuzzy Description Logic for Semantics Representation of the Semantic Web. Journal of Software, Vol. 18(2007), pp.1257-1269 (In Chinese).

DOI: 10.1360/jos181257

Google Scholar

[9] F. Baader, D. Calvanese, et al. in: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge: Cambridge University Press (2003).

Google Scholar

[10] I. Horrocks, S. Tobies, U. Sattler: A PSPACE-algorithm for deciding ALCNIR+-satisfiability.

DOI: 10.25368/2022.84

Google Scholar