Initial ideas on Distributed Reasoning. Expressivity The subset of RDF/OWL and that has rule- based inference – OWL –RL In general, datalog Example: –

Slides:



Advertisements
Similar presentations
Ontologies and Databases Ian Horrocks Information Systems Group Oxford University Computing Laboratory.
Advertisements

RDF Briefing Frank van Harmelen Vrije Universiteit Amsterdam.
Distributed Computations
Linear Discriminant x2x2 x1x1 class 1 class 2 g 1 (x|w 1 )= w 10 + w 11 x 1 + w 12 x 2 e.g.: 1 - 5x 1 + 4x 2 (5,7) (8,7)
CS 4432query processing1 CS4432: Database Systems II.
Introduction to Database Systems 1 Relational Algebra Relational Model: Topic 3.
Distributed Computations MapReduce
©2003, Philippe Cudre-Mauroux, EPFL-I&C-IIF, Laboratoire de systèmes d'informations répartis LSIR Weekly seminar Mapping the Semantic Web.
9.1 – Students will be able to evaluate square roots.Students will be able to solve a quadratic equation by finding the square root. 1. 3x +(– 6x) Warm-Up.
Semantic Web Ontologies (continued) Expressing, Querying, Building CS 431 – April 6, 2005 Carl Lagoze – Cornell University.
Equivalent Fractions Equivalent Fractions Using Cross-Multiplication.
Relational Algebra.
Splash Screen. Lesson 1 Menu Five-Minute Check (over Chapter 6) Main Ideas and Vocabulary California Standards Example 1: Identify Monomials Key Concept:
Chapter 2 Working with Real Numbers. 2-1 Basic Assumptions.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 8–3) CCSS Then/Now Key Concept: Square of a Sum Example 1:Square of a Sum Key Concept: Square.
Mathematical Properties Algebra I. Associative Property of Addition and Multiplication The associative property means that you will get the same result.
MULTIPLICATION 3x8: ?. What does it mean? Multiplication means that you have a certain number of groups of the same size. How can you express the same.
Parallel Programming Models Basic question: what is the “right” way to write parallel programs –And deal with the complexity of finding parallelism, coarsening.
OWL and SDD Dave Thau University of Kansas
OWL 2 Web Ontology Language. Topics Introduction to OWL Usage of OWL Problems with OWL 1 Solutions from OWL 2.
OWL 2 in use. OWL 2 OWL 2 is a knowledge representation language, designed to formulate, exchange and reason with knowledge about a domain of interest.
MapReduce M/R slides adapted from those of Jeff Dean’s.
Splash Screen.
Commutative and Associative Properties Return to table of contents.
Warm-up over Lesson 5-1.
GOAL: MULTIPLY TWO POLYNOMIALS TOGETHER USING THE DISTRIBUTIVE PROPERTY ELIGIBLE CONTENT: A Multiplying Polynomials.
Integers and Properties
Simple Factoring Objective: Find the greatest common factor in and factor polynomials.
MA.912.A.4.2: Add, subtract, and multiply polynomials. Which of the following expressions is equivalent to (5x − 3) 2 ? A. 25x 2 − 30x + 9 B. 25x 2 −
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 10–5) CCSS Then/Now New Vocabulary Example 1:Real-World Example: Use Pascal’s Triangle Key Concept:
Unit 2, Lesson 2: The Distributive Property and Factoring.
© 2012 Unisys Corporation. All rights reserved. 1 Unisys Corporation. Proprietary and Confidential.
Information Retrieval Lecture 9. Outline Map Reduce, cont. Index compression [Amazon Web Services]
Semantic Web Ontologies CS 431 – Carl Lagoze – Cornell University Acknowledgements: Alun Preece.
1 Logic Programming Robert Kowalski’s equation: Algorithm = Logic + Control Definite logic program: A  B 1, B 2, …, B m (program clause) headbody  A.
By Jeff Dean & Sanjay Ghemawat Google Inc. OSDI 2004 Presented by : Mohit Deopujari.
COMPASS Algebra Practice Test 3 This practice test is 10 items long. Record your responses on a sheet of paper. The correct answers are on the slide after.
Chapter 5 Ranking with Indexes 1. 2 More Indexing Techniques n Indexing techniques:  Inverted files - best choice for most applications  Suffix trees.
Practical RDF Chapter 12. Ontologies: RDF Business Models Shelley Powers, O’Reilly SNU IDB Lab. Taikyoung Kim.
Of 38 lecture 6: rdf – axiomatic semantics and query.
Team3: Xiaokui Shu, Ron Cohen CS5604 at Virginia Tech December 6, 2010.
Algebra 1 Mini-Lessons 3x2y(6y + 12xy − 9x) 3(6x2y2 + 12x3y3 − 9x3y)
Multiplying Powers Dividing Powers Zero ExponentsNegative.
Bell Ringer: Simplify each expression
MapReduce: Simplified Data Processing on Large Clusters By Dinesh Dharme.
Ontology Engineering Lab #4 - September 23, 2013.
Expressions & Equations Properties And Like Terms.
An Optimization Technique for RDFS Inference using the Application Order of RDFS Entailment Rules Kisung Kim, Taewhi Lee
LESSON 5–6 Graphing Inequalities in Two Variables.
COMPASS Practice Test 12 1.If x = -2 and y = -3, what is the value of the expression 4x 3 - 2xy ?  A.36  B.20  C.-20  D.-36  E.-44 4x 3 - 2xy 4(-2)
1 Math I can create equivalent expressions. By Combining Like Terms 1.
Splash Screen Unit 6 Exponents and Radicals. Splash Screen Essential Question: How do you use the properties of exponents to divide monomials?
Distributive Property, Combining Like Terms (1-4) Objective: Use the Distributive Property to evaluate and simplify expressions. Combine like terms.
HADOOP Priyanshu Jha A.D.Dilip 6 th IT. Map Reduce patented[1] software framework introduced by Google to support distributed computing on large data.
Splash Screen Unit 8 Quadratic Expressions and Equations EQ: How do you use addition, subtraction, multiplication, and factoring of polynomials in order.
Extensions of Datalog Wednesday, February 13, 2001.
SAT/ACT MATH UNIT 10 Equation with More Than One Variable.
Splash Screen. Lesson Menu Five-Minute Check (over Lesson 8–3) CCSS Then/Now Key Concept: Square of a Sum Example 1:Square of a Sum Key Concept: Square.
2.5 Algebra Reasoning. Addition Property: if a=b, then a+c = b+c Addition Property: if a=b, then a+c = b+c Subtraction Property: if a=b, then a-c = b-c.
Some slides adapted from those of Yuan Yu and Michael Isard
Building Trustworthy Semantic Webs
Lesson: Extension Cubic Functions and Equations
Cse 344 May 4th – Map/Reduce.
Dynamo Recap Hadoop & Spark
Distributing, Sets of Numbers, Properties of Real Numbers
Distributed System Gang Wu Spring,2018.
Semantic Web Ontologies & Data Models
Ontologies and Databases
Factoring Using Distributive Property and Grouping
Presentation transcript:

Initial ideas on Distributed Reasoning

Expressivity The subset of RDF/OWL and that has rule- based inference – OWL –RL In general, datalog Example: – rdfs:domain, range, subClassof, subPropertyof – Inverseof, transitive property, symmetic property, – …

RDF/OWL -> Datalog Subproperty Subclass Class instance Property instance Redirection P(x,y) :- Q(x,y). C(x) :- D(x). C(a). P(a,b). a=b.

RDF/OWL -> Datalog Domain Range Transitive P Symmetric P Functional P InverseFunctional P Inverse of C(x) :- P(x,y) C(y) :- P(x,y) P(x,y) :- P(x,z), P(z,y) P(x,y) :- P(y,x) SameAs(x,y) :- P(z,x),P(z,y) SameAs(x,y) :- P(x,z),P(y,z) Q(x,y) :- P(y,x)

RDF/OWL -> Datalog Conjunction Disjunction Property Chain Negation Has Value Cardinality C(x) :- A(x), B(x). C(x) :- A(x). C(x):- B(x). R (x,y):- P(x,z), Q(z,y). C(x):- not D(x). C(x): - #count{x, P(x,y)}<=0. C(x) :- P(x,a). C(x) : #count{x, P(x,y)}>=3. This is also query language

Remote Join Free Assumption: data are distributed; rule set is relatively small, every node has the full rule set – Data can be duplicated in GIDS manner If there is no join, the result set can be a simple union – Domain, range, subC, subP, inverseOf, symmetric, disjunction, has value Each node compute a local answer, the whole answer set is their union

MapReduce void map(String name, String document): // name: document name // document: document contents for each word w in document: EmitIntermediate(w, "1"); void reduce(String word, Iterator partialCounts): // word: a word // partialCounts: a list of aggregated partial counts int result = 0; for each pc in partialCounts: result += ParseInt(pc); Emit(AsString(result)); Negation and cardinality queries can be distributed by MapReduce (counting) Also see:

Remote Join E.g. C(x) :- D(x), E(x) – Node 1: { D(a) } – Node 2: { E(a) } One solution: in query answering, do dependency check, and copy partial result to one place E.,g. C1(x) : - D(X) C2(x) :-E(X) – Copy instances of C1 and C2 to one node – On that node, add rule C(x) :-C1(x), C2(x) Optimization: hashing or indexing?