Rya Query Inference.

Slides:



Advertisements
Similar presentations
Data-Flow Analysis Framework Domain – What kind of solution is the analysis looking for? Ex. Variables have not yet been defined – Algorithm assigns a.
Advertisements

Chapter 12: Expert Systems Design Examples
The Design and Implementation of Minimal RDFS Backward Reasoning in 4store Manuel Salvadores, Gianluca Correndo, Steve Harris, Nick Gibbins, and Nigel.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #6.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
Managing Large RDF Graphs (Infinite Graph) Vaibhav Khadilkar Department of Computer Science, The University of Texas at Dallas FEARLESS engineering.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Database Support for Semantic Web Masoud Taghinezhad Omran Sharif University of Technology Computer Engineering Department Fall.
Chapter 2.1 Common Core G.CO.9, G.CO.10 & G.CO.11 Prove theorems about lines, angles, triangles and parallelograms. Objective – To use inductive reasoning.
 Copyright 2007 Digital Enterprise Research Institute. All rights reserved. Digital Enterprise Research Institute Scalable Authoritative OWL.
Do Now 12/18/09  Copy HW in your planner.  Text p. 384, #5-10 all, even, 38 & 40  Quiz sections Tuesday  In your notebook, put the.
Jess: A Rule-Based Programming Environment Reporter: Yu Lun Kuo Date: April 10, 2006 Expert System.
Programming in R SQL in R. Running SQL in R In this session I will show you how to: Run basic SQL commands within R.
Chapter 2 Section 4 Reasoning in Algebra. Properties of Equality Addition Property of Equality If, then. Example: ADD 5 to both sides! Subtraction Property.
Efficient RDF Storage and Retrieval in Jena2 Written by: Kevin Wilkinson, Craig Sayers, Harumi Kuno, Dave Reynolds Presented by: Umer Fareed 파리드.
Welcome to the Twin Cities BizTalk User Group July 2006.
MuSL Builder Handcrafting custom Mu Scenarios. MuSL in the Mu Scenario Editor.
CS779 Term Project Steve Shoyer Section 5 December 9, 2006 Week 6.
Ontology Engineering Lab #5 – September 30, 2013.
Logics for Data and Knowledge Representation Web Ontology Language (OWL) -- Exercises Feroz Farazi.
SECTION 2-6 Algebraic Proofs JIM SMITH JCHS. Properties we’ll be needing REFLEXIVE -- a=a SYMMETRIC -- if x=2 then 2=x TRANSITIVE -- if a=b and b=c then.
Threads and Singleton. Threads  The JVM allows multiple “threads of execution”  Essentially separate programs running concurrently in one memory space.
Of 38 lecture 6: rdf – axiomatic semantics and query.
Semantic Web for the Working Ontologist - RDFS-Plus TEAM C 현근수, 김영욱, 백상윤, 이용현.
1 Copyright © 2005, Oracle. All rights reserved. Following a Tuning Methodology.
Text INTRODUCTION TO ASP.NET. InterComm Campaign Guidelines CONFIDENTIAL Simply Server side language Simplified page development model Modular, well-factored,
An Optimization Technique for RDFS Inference using the Application Order of RDFS Entailment Rules Kisung Kim, Taewhi Lee
Summary for final exam Agent System..
CS 562 Advanced Java and Internet Application Computer Warehouse Web Application By Team Alpha :-  Puja Mehta (102163)  Mona Nagpure (102147)
Page Redirection When you click a URL to reach to a page X but internally you are directed to another page Y that simply happens because of page re- direction.
11 Copyright © 2009, Oracle. All rights reserved. Enhancing ETL Performance.
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Distributed Systems Architectures Chapter 12. Objectives  To explain the advantages and disadvantages of different distributed systems architectures.
Copyright © 2006, Oracle. All rights reserved Rule Engine.
Rya Working Group: Back end persistence methods for Rya.
Static Software Metrics Tool
© 2016, Mike Murach & Associates, Inc.
Congruent Angles.
By P. S. Suryateja Asst. Professor, CSE Vishnu Institute of Technology
Provides Confidentiality
Splash Screen.
LOCO Extract – Transform - Load
Properties of Equality and Solving One-Step Equations
Splash Screen.
Behavioral Design Patterns
Using Rules with Ontologies in the Semantic Web
“This presentation is for informational purposes only and may not be incorporated into a contract or agreement.”
Mathematical Practices Then/Now New Vocabulary
2.5 Reasoning with properties from Algebra
Chapter 7: Introduction to CLIPS
SQL – Application Persistence Design Patterns
COTS testing Tor Stålhane.
Lesson 1: Introduction to Trifacta Wrangler
Triple Stores.
Transactions, Locking and Query Optimisation
Model the non-negative even integers
Properties of Equality
Scalable and Efficient Reasoning for Enforcing Role-Based Access Control
Standard: MCC9-12.A.REI.1 – Explain each step in solving a simple equation as following from the equality of numbers asserted at the previous step,
MORE ON ARCHITECTURES The main reasons for using an architecture are maintainability and performance. We want to structure the software into reasonably.
Strategy Design Pattern
Scalable and Efficient Reasoning for Enforcing Role-Based Access Control
Logics for Data and Knowledge Representation
Inverted Indexing for Text Retrieval
The “Fast-Food” Essay (Ideas from
Appendix D: Network Model
Properties of Equality
ONTOMERGE Ontology translations by merging ontologies Paper: Ontology Translation on the Semantic Web by Dejing Dou, Drew McDermott and Peishen Qi 2003.
Maths Unit 7 (F) – Equations & Sequences
Presentation transcript:

Rya Query Inference

Overview Rya Inference Capabilities Backwards chaining inference Other inference strategies

Rya Inference Capabilities Rya supports backwards chaining inference for the following constructs: Owl:sameAs, rdfs:subclassOf, rdfs:subPropertyOf, symmetric properties, transitive properties, inverse properties Inference is initiated by initializing a inference engine The inference engine loads model information into memory (client side) This model information is refreshed on a regular basis (default is five minutes) by a concurrent thread running client side The inference engine is used at query time to expand queries

Backwards Chaining Inference Query is expanded at query execution time to include inferred triples Example: Original Query: SELECT ?person WHERE { ?person rdf:type <urn:Person>. } Expanded Query: {?person rdf:type <urn:Person>. } UNION { {?person rdf:type ?dummy. ?dummy rdf:subclassOf <urn:Person>. } }

Backwards Chaining Inference in Rya Inference is implemented as a set of visitors All of the visitors are in mvm.rya.rdftriplestore.inference package In general, visitor: Looks for a specific statement pattern type (keys off of a predicate) Expands the query to include a dummy join (InferJoin) Substitutes a “FixedStatementPattern” statement pattern for the left side of the dummy join Substitutes a “DoNotExpandStatementPattern” statement pattern for the right side of the dummy join

Backward Chaining Example: Original Query SELECT ?person { ?person rdf:type <urn:person>. ?person <urn:name> “Jane”.} ?person rdf:type <urn:Person>. ?person <urn:name> “Jane”.

Backward Chaining Example: Expanded Query Infer Join ?person <urn:name> “Jane”. Fixed Do Not Expand ?dummyClass = <urn:Mother>, <urn:Father>, <urn:HappyPerson>, <urn:SadPerson>, <urn:Person>. ?person rdf:type ?dummyClass.

Code Example: MongoRyaDirectExample

Other inference strategies Materializing inferred statements Instead of expanding the query, materialize inferred triples and add them to Rya (forward chaining reasoning) Scalability concerns Consistency concerns Keep model information in a specific index Materialize inferred statements model definition statements in a separate index rather than with the explicitly asserted data Removes the need to load it client side (which may have scalability issues for large models)