This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
hekate:dl_intro [2010/04/22 13:22] ikaf scheme removed |
hekate:dl_intro [2013/11/03 14:08] ikaf [Semantic Web] |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ~~SLIDESHOW~~ | + | ~~SLIDESHOW~~ |
| ~~ODT~~ | ~~ODT~~ | ||
| Line 31: | Line 31: | ||
| * the way to do it is to present information in some standarized formats (markup languages) and give the means to reason about it | * the way to do it is to present information in some standarized formats (markup languages) and give the means to reason about it | ||
| * ++ the world wide research began... | e.g., just to start with: [[http://www.w3.org/2001/sw/|W3C Semantic Web Activity Website]] ++ | * ++ the world wide research began... | e.g., just to start with: [[http://www.w3.org/2001/sw/|W3C Semantic Web Activity Website]] ++ | ||
| + | |||
| ===== Semantic Web Layer Cake(s) ===== | ===== Semantic Web Layer Cake(s) ===== | ||
| {{ :hekate:semweb:sw_layer_cakes.png |sw layer cakes}} | {{ :hekate:semweb:sw_layer_cakes.png |sw layer cakes}} | ||
| Line 177: | Line 177: | ||
| |An animal lover **has minimun 3 pets** | <latex> \geq nP </latex> | <latex> \exists^{\geq n}y.P(x,y)</latex> | <latex> card(P) \geq n </latex> | | |An animal lover **has minimun 3 pets** | <latex> \geq nP </latex> | <latex> \exists^{\geq n}y.P(x,y)</latex> | <latex> card(P) \geq n </latex> | | ||
| |A kid **is the same as** a young person |<latex> C \equiv D </latex> | <latex> \forall x.C(x) \leftrightarrow D(x) </latex> | <latex> C \equiv D </latex> | | |A kid **is the same as** a young person |<latex> C \equiv D </latex> | <latex> \forall x.C(x) \leftrightarrow D(x) </latex> | <latex> C \equiv D </latex> | | ||
| - | |**Every cat is an animal** | <latex> C \sqsubseteq D </latex> | <latex> \forall x.C(x) \rightarrow D(x) </latex> | <latex> C \subseteq D </latex> | | + | |**Every cat is an animal** | <latex> C \sqsubseteq D </latex> | <latex> \forall x.C(x) \rightarrow D(x) </latex> | <latex> C \subseteq D </latex> | |
