Abstract
Semantic Reasoners are the set of applications that can provide inferences over semantic data sets. As the types of data ontologies, the amount of instance data based on those ontologies, and the type of required inferences grow, the problem of reasoning becomes increasingly difficult. Linking of the Data within the enterprise as with the case of external data explodes the scaling problem. In this chapter, we look at various reasoning techniques and how to assure that they can scale properly so that Linking Data results in additional knowledge.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Thulasiraman, K.; Swamy, M. N. S. (1992) 5.7 Acyclic Directed Graphs, Graphs: Theory and Algorithms, John Wiley and Son, p. 118, ISBN 9780471513568
Fukushige, Yoshio. Representing Probabilistic Knowledge in the Semantic Web, 2004. Matsushita Electric Industrial Co., Ltd., http://www.w3.org/2004/09/13-Yoshio/PositionPaper.html
Rong Pan, Zhongli Ding, Yang Yu, and Yun Peng. A Bayesian Network Approach to Ontology Mapping, Proceedings of the Fourth International Semantic Web Conference. November 06, 2005
Reza BFar, Tsai-Ming Tseng, Ryan Golden, Yasin Cengiz, Nigel Jacobs. SDR: An Architectural Approach to Distribution of Complex Ontology Processing, SWWS 2009: 10-18
Zhongli Ding and Yun Peng. A Probabilistic Extension to Ontology Language OWL, Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, Proceedings of the 37th Hawaii International Conference on System Sciences 2004
Curtis Huttenhower and Olga G. Troyanskaya. Bayesian data Integration: A Functional Perspective, Department of Computer Science, Lewis-Sigler Institute for Integrative Genomics,Princeton University, Proceedings of 2006 LSS Computational Systems Bioinformatics Conference
Pavel Berkhin, Survey of Clustering Data Mining Techniques, http://www.cs.unc.edu/Courses/comp790-090-s10/Papers/clustering survey.pdf
Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, and Yardan katz. Pellet: A practical OWL-DL reasoner. Web Semant., 2007
Peter Norvig and Stuart Russell. Artificial Intelligence, AModern Approach, Second Edition. Prentice Hall, ISBN-0-13-790395-2, 2003
Peiqiang Li, Yi Zeng, Spyros Kotoulas, Jacopo Urbani, and Ning. The Quest for Parallel Reasoning on the Semantic Web, Proceedings of the 5th International Conference on Active Media Technology, 2009. 430-441. ISBN:978-3-642-04874-6
M. Fiedler. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Math. J., 25:619633, 1975.
Karen Devine, Sandia National Laboratories, Erik Boman, Sandia National Laboratories, Umit ataly¨urek, Ohio State University, Lee Ann Riesen, Sandia National Laboratories Partitioning and Dynamic Load Balancing for Petascale Applications, 2007
Reza B. Far, Tsai-Ming Tseng, Ryan Golden, Yasin Cengiz, Nigel Jacobs: SDR: An Architectural Approach to Distribution of Complex Ontology Processing. SWWS 2009: 10-18
Jeffery Dean and Sanjay Ghemawat, MapReduce: Simplified Data Processing on Large Clusters, Sixth Symposium on Operating System Design and Implementation, 2004. Page 1
Ivar Jacobson, Magnus Christerson, Patrik Jonsson and Gunnar ¨O vergaard, Object-Oriented Software Engineering: A Use Case Driven Approach. ACM Press. Addison-Wesley, 1992, ISBN 0201544350, pp. 69-70
R. Fikes and N. Nilsson (1971). STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208.
Garey, M.R.; Johnson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman. ISBN0-7167-1045-5. This book is a classic, developing the theory, then cataloguing many NP-Complete problems.
Forgy, C.L. (1974) A Network Match Routine for Production Systems, Working Paper.
Radu Rugina and Martin Rinard, Recursion unrolling for divide and conquer programs, in Languages and Compilers for Parallel Computing, chapter 3, pp. 3448. Lecture Notes in Computer Science vol. 2017 (Berlin: Springer, 2001).
A. De Nicola, M. Missikoff, R. Navigli (2009). A Software Engineering Approach to Ontology Building. Information Systems, 34(2), Elsevier, 2009, pp. 258-275
Gruber, T. R. 1993. A translation approach to portable ontology specifications. In: Knowledge Acquisition. 5: 199199.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
B’Far, R. (2010). Scalable Reasoning Techniques for Semantic Enterprise Data. In: Wood, D. (eds) Linking Enterprise Data. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-7665-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-7665-9_7
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-7664-2
Online ISBN: 978-1-4419-7665-9
eBook Packages: Computer ScienceComputer Science (R0)