Proposed Representation Approach Based on Description Logics Formalism

Full Text (PDF, 789KB), PP.1-9

Views: 0 Downloads: 0


Yasser Yahiaoui 1,* Ahmed Lehireche 2 Djelloul Bouchiha 1

1. Institute of sciences & technologies department of mathematics & Informatics Engineering, Naâma University center, Naâma, Algeria

2. EEDIS Labo, University of Sidi Bel Abbes, Algeria

* Corresponding author.


Received: 1 Sep. 2015 / Revised: 10 Nov. 2015 / Accepted: 22 Jan. 2016 / Published: 8 May 2016

Index Terms

Knowledge representation, subsumption hierarchical attribute, reasoning Algorithm, description logics, vectorial reasoning


The most familiar concept in Artificial intelligence is the knowledges representation. It aims to find explicit symbolization covering all semantic aspects of knowledge, and to make possible the use of this representation to produce an intelligent behavior like reasoning.
The most important constraint is the usability of the representation; it’s why the structures used must be well defined to facilitate manipulation for reasoning algorithms which leads to facilitate their implementation.
In this paper we propose a new approach based on the description logics formalism for the goal of simplification of description logics system implementation. This approach can reduce the complexity of reasoning Algorithm by the vectorisation of concept definition based on the subsumption hierarchy.

Cite This Paper

Yasser Yahiaoui, Ahmed Lehireche, Djelloul Bouchiha, "Proposed Representation Approach Based on Description Logics Formalism", International Journal of Intelligent Systems and Applications(IJISA), Vol.8, No.5, pp.1-9, 2016. DOI:10.5815/ijisa.2016.05.01


[1]Souleymane Koussoube, Roger Noussi, Balira O. Konfe, «Using Description Logics to specify a Document Synthesis System» I.J. Intelligent Systems and Applications, 2013, 03, 13-22.
[2]F. V. Harmelen, and al; «Handbook of knowledge representation » P135 Elsevier 2008.
[3]Franz Baader, and al; «the description logics handbook: theory, implementation and application»P 345 cambredge university press 2003.
[4]Levesque, H. J., & Brachman, R. J. (1987). Expressiveness and tractability in knowledge representation and reasoning. Computational Intel ligence, 3 (2), 78{93.
[5]Patel-Schneider, P. F. (1989). Undecidability of subsumption in NIKL. Artificial Intel ligence, 39 (2), 263{272.
[6]Alex Borgida & Peter F. Patel-Schneider; (1994) “A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic”, Journal of Artificial Intelligence Research 1 (1994) 277 308.
[7]D. Nardi, R. J. Brachman. An Introduction to Description Logics. In the Description Logic Handbook, edited by F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, P.F. Patel-Schneider, Cambridge University Press, 2002, pages 5-44.
[8]Sergio Tessaris; “questions and answers: reasoning and querying in description logic” a PhD Thesis at university of Manchester the faculty of science and engineering, April 2001.
[9]Ian Horrocks. “Optimising Tableaux Decision Procedures For Description Logics”. A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Science and Engineering. University of Manchester, 1997 (p20).
[10]A. Borgida and P. F. Patel-Schneider. “A Semantics and Complete Algorithm For Subsumption In The Classic Description Logic”. Journal of Artificial Intelligence Research, 1:277{308, 1994.
[11]Ian R. Horrocks. Optimising Tableaux Decision Procedures for Description Logics. A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Science and Engineering. 1997.
[12]R. M. Smullyan. First-Order Logic. Springer-Verlag, 1968.
[13]F. Baader, B. Hollunder, B. Nebel, and H.-J. Pro Ulrich. An empirical analysis of optimization techniques for terminological representation systems. In B. Nebel, C. Rich, and W. Swartout, editors, Principals of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR'92), pages 270{281. Morgan-Kaufmann, 1992. Also available as DFKI RR- 93-03.
[14]Nenad Krdžavac, Dragan Gašević, and Vladan Devedžić; “Model Driven Engineering of a Tableau Algorithm for Description Logics” ComSIS Vol. 6, No. 1, June 2009.
[15]B. Cuenca Grau, B. Motik, G. Stoilos and I. Horrocks; "Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice", 2012, Volume 43, pages 419-476.
[16]Ullrich Hustadt, Boris Motik, Ulrike Sattler; “Reasoning in Description Logics by a Reduction to Disjunctive Datalog” Journal of Automated Reasoning October 2007, Volume 39, Issue 3, pp 351-384.