A proposed reasoning Algorithm using DLs in vectorial form
Article No.: 20, Pages 1 - 10
Abstract
In this paper, we describe a new representative attribute derived from description logics formalism. This attribute constructed using subsumption hierarchy, is very meaningful and can help to perform a simplest form of reasoning Algorithm based on vectors comparing, which yields to an efficient description logics system.
We use for experimentation the famous description logics human beings knowledge base. The aim is to proof that the same expansions can be achieved using simplest reasoning Algorithm.
References
[1]
Christopher Welty. An HTML interface for Classic. In Proc. of the 1996 Description Logic Workshop (DL'96), number WS-96-05 in AAAI Technical Report. AAAI Press/The MIT Press, 1996.
[2]
Sean Bechhofer, Ian Horrocks, Peter F. Patel-Schneider, and Sergio Tessaris. A proposal for a Description Logic interface. In Proc. of the 1999 Description Logic Workshop (DL'99), pages33--36. CEUR Electronic Workshop. And Jérôme Euzenat. Preserving modularity in XML encoding of Description Logics. In Proc. of the 2001 Description Logic Workshop (DL 2001), pages20--29. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-49/,2001.
[3]
Franz Baader, and al; « the description logics handbook: theory, implementation and application »P 22 cambredge university press 2003
[4]
F. Baader and C. Lutz. Description Logic. In P. Blackburn, J. van Benthem, and F. Wolter, "The Handbook of Modal Logic", pages 757--820. Elsevier, 2006.
[5]
F. Van Harmelen V. Lefchitz and B. Poter "Handbook of knowledge repesentation" Elsevier B.V. page 165,169. 2008 And
[6]
M. Chavira and A. Darwiche "compiling Bayesian net Works using variable lelemination" Inproceeding of the 20th international joint conference on Artificial inteligence IJCAI page 2443--2449, 2007 And
[7]
Dechter, K. Kask, and Matteescu; "Bayesian inference in the presence of determinism" In CM Bishop and Frey editors, in proceedings of the ninth international workshop on artificial intelligence and statistics, FL 2003.
[8]
Ronald J. Brachman and JamesG. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171--216, 1985.
[9]
William A. Woodsand JamesG. Schmolze. The KL-ONE family. In F. W. Lehmann, editor, Semantic Networks in Artificial Intelligence, pages 133--178. Pergamon Press, 1992. Published as a special issue of Computers & Mathematics with Applications, Volume 23, Number 2--9.
[10]
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
[11]
B. Hollunder and W. Nutt. Subsumption algorithms for concept languages. Research Report RR-90-04, Deutsches Forschungszentrum fû;r Kûnstliche Intelligenz GmbH (DFKI), April 1990
[12]
F. Baader and B. Hollunder. Kris: Knowledge representation and inference system. SIGART Bulletin, 2(3):8--14, 1991.
[13]
F. Baader and B. Hollunder. Kris: Knowledge representation and inference system. SIGART Bulletin, 2(3):8--14, 1991.
[14]
Sattler, Ulrike. A concept language extended with different kinds of transitive roles. In: KI-96: Advances in Artificial Intelligence. Springer Berlin Heidelberg, 1996. p. 333--345.
[15]
Baader, Franz. Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. 2011.
[16]
K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proceedings of IJCAI-91 {Pro91}, pages 466--471
[17]
G. De Giacomo and M. Lenzerini. TBox and ABox reasoning in expressive description logics. In Aiello et al. {ADS96}, pages 316--327.
[18]
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
[19]
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.
[20]
R. M. Smullyan. First-Order Logic. Springer-Verlag, 1968.
[21]
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.
[22]
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
[23]
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
[24]
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
Index Terms
- A proposed reasoning Algorithm using DLs in vectorial form
Recommendations
Reasoning with vagueness in hybrid MKNF knowledge bases
We present an infrastructure for describing and handling uncertainty and vagueness in a combination of Description Logics and rules in the Semantic Web. More concretely, we apply fuzzy set theory to hybrid MKNF knowledge bases, and establish fuzzy ...
On the succinctness of some modal logics
One way of comparing knowledge representation formalisms that has attracted attention recently is in terms of representational succinctness, i.e., we can ask whether one of the formalisms allows for a more 'economical' encoding of information than the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
November 2015
495 pages
ISBN:9781450334587
DOI:10.1145/2816839
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 November 2015
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
IPAC '15
IPAC '15: International Conference on Intelligent Information Processing, Security and Advanced Communication
November 23 - 25, 2015
Batna, Algeria
Acceptance Rates
Overall Acceptance Rate 87 of 367 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 28Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in