Your SlideShare is downloading.
×

- 1. BLOGIC <ul><ul><ul><ul><ul><li>Pat Hayes Florida IHMC </li></ul></ul></ul></ul></ul>ISWC 2009
- 2. Web Logic = Blogic <ul><li>(Please do not ask me about Alogic.) </li></ul>
- 3. Two talks...Blogic + RDF Redux <ul><li>(I couldn't decide which one to give, so you are getting both.) </li></ul><ul><li>Blogic theme: when logic gets on the Web, it really needs to be re-thought from the ground up. It is a new subject. </li></ul><ul><li>RDF Redux theme: with hindsight, we can do RDF better, making it into a fully expressive Common Logic dialect. </li></ul><ul><li>Revised RDF could be a real logic for the SWeb, the first true blogic. </li></ul>
- 4. What y'all might be thinking at this point. <ul><li>Please, enough with the logic already . We have way too many web logics, a positive zoo of endangered OWL species, so don't give us another one. </li></ul><ul><li>Even if you are right, its too late . You and Guha tried, Pat, but nobody was interested in LBase and only about four people have read the Common Logic spec. Give up on it, the RDF/OWL train has left the station. </li></ul>
- 5. Why isn't Blogic just Logic? <ul><li>The web portability principle. </li></ul><ul><li>Names and identification. </li></ul><ul><li>The Horatio principle. </li></ul><ul><li>SameAs not the same as. </li></ul><ul><li>Death by Layering. </li></ul>
- 6. <ul><li>Say what you are going to say next. </li></ul><ul><li>Say it. </li></ul><ul><li>Say what it was you just said. </li></ul><ul><li>Say it again. </li></ul>Speaking
- 7. Web portability Some Logic Stuff Some other Logic Stuff Entails The same Logic Stuff but somewhere else Entails HTTP HTTP The same other Logic Stuff but somewhere else This diagram should always commute:
- 8. Web portability :Married rdf:type :ConjugalRelation :Jill :Married :Jack :Married rdf:type :ConjugalRelation :Jill :Married :Jack HTTP _:x rdf:type :ConjugalRelation :Jill _:x :Jack Entails
- 9. Web portability <ul><li>RDF is portable. ISO Common Logic is portable. </li></ul><ul><li>OWL-DL, classical FOL syntax are not portable </li></ul><ul><li>OWL 2 is not portable but is better than OWL. Maybe OWL 3 will be portable. Sigh. </li></ul>
- 10. Names <ul><li>Names are central in blogic. They are global in scope. They have structure . They link blogical content to other meaningful things, including other blogical content. They embody human/social meanings as well as being conduits and route maps for information transfer. In many ways, the Web is constituted by the links which are the blogic names, and the logical content which we write using those names is only one component, perhaps a minor one, of the whole social and technical structure which determines their meanings. And yet seen from the perspective of the logic, these IRIs are merely "logical names", elements of an arbitrary set of meaningless character strings. In AI/KR, we teach our students that the names are irrelevant, because one can replace them all with gensyms without changing the logical meaning . </li></ul><ul><li>Clearly, there is something unsatisfactory about this picture, a serious disconnect between the classical logical view of names as simply uninterpreted strings waiting in a kind of blank innocence to have their possible interpretations controlled by the pure semantic power of the axioms that use them, and the reality of the almost unrestricted referential power that these names actually have in the dynamics of the Web. Think of the concern and attention that is devoted to their choice, who owns them, who is responsible for maintaining and controlling them, and the ways they are decomposed and used in the planet-wide machinery called the Internet, none of which has very much at all to do with logical assertions. Another way to put it: IRIs are *identifiers*, not mere logical names. Unfortunately, nobody seems to be able to say what in God's name that can possibly mean. </li></ul><ul><li>HTTP-range-14 is just one symptom of this disconnect. </li></ul>
- 11. Names and RDF <ul><li>RDF semantic interpretations are stated as mappings on a 'vocabulary' = a set of names. Textbook logic stuff, but wrong for a blogic like RDF. </li></ul><ul><li>Redux: we should have said that every interpretation is a mapping from all URI references. There are no 'local' names in RDF. </li></ul>
- 12. Horatio principle <ul><li>There are more things in heaven and earth, Horatio, than are dreamt of in your ontology. </li></ul><ul><li>So you cannot say " forall x... ", only " forall x in class C,.. . " </li></ul>
- 13. SameAs not the same as <ul><li>A sameAs B doesn't mean that anything you say about A is also true of B (when referred to by that name). The name you use matters . </li></ul><ul><li>Sodium </li></ul><ul><li>You say 3D, and I say 4D </li></ul><ul><li>Linked data needs to be able to express co-reference without implying acceptance of an entire conceptualization. Is there a "degree of ontological commitment" (?) </li></ul><ul><li>"Nearly same as" = "slightly pregnant" </li></ul><ul><li>Lynn Stein: social roles for names and descriptors. Speech-act semantics?? </li></ul>
- 14. Death by Layering <ul><li>The 'layer cake' diagram is good computer architecture but really, really bad semantic architecture. Blogical forms do not naturally layer, because names have a different logical status at different levels. </li></ul><ul><li>OWL/RDF is layered on RDF in this way, which is why SPARQL cannot know what 'entailed' means. </li></ul><ul><li>The same piece of logical text has several different entailment regimes applying to it, with no way to communicate which one is intended, destroying portability. </li></ul><ul><li>This is a mess, which will get worse. It will not fix itself. We need to provide blogic as a single layer with one notion of entailment. It can have subcases, but not layers. </li></ul>
- 15. OK, part two: RDF Redux <ul><li>With hindsight comes wisdom. </li></ul><ul><li>There are many things wrong with RDF which should be done better. </li></ul><ul><li>Literals allowed in subject position; naming graphs; a nuanced version of importing; not having plain literals and xsd:string as a datatype; reification; containers; etc.. Details, details. </li></ul><ul><li>But there is a much more fundamental glitch in the RDF conceptual model, one that we simply missed. Fixing that one properly makes RDF simpler, more rational, more useful and vastly more expressive. </li></ul>
- 16. The matter of the blank node <ul><li>Blank nodes in current RDF are broken. </li></ul>
- 17. Why are blank nodes so hard to get right? <ul><li>RDF abstract syntax is a node-arc diagram </li></ul><ul><li>Blank nodes are just nodes that have no label . </li></ul><ul><li>That seems pretty obvious. </li></ul>
- 18. <ul><li>blank nodes are just nodes that have no label. </li></ul><ul><li>That seems pretty obvious. </li></ul>But its not so obvious how to say this mathematically . The RDF spec uses set language: it says that an RDF graph is a set of triples, and that blank nodes are elements of a set of items disjoint from URIs and literals. But there is something fundamentally wrong with this 'set' style of describing syntax . Why are blank nodes so hard to get right?
- 19. <ul><li>Mathematical sets aren't the right kind of thing to make syntax out of. </li></ul><ul><li>Sets exist in a Platonic universe of abstractions. There is no type/token distinction. You can't copy a set. You can't write or transmit a set. You can't put a set on a Web server. </li></ul><ul><li>There are unresolved puzzles. Is any set of triples an RDF graph? </li></ul><ul><li>The same blank node might be in several graphs (why not, when a graph is just a set?) Hence we get union versus merge , etc.. </li></ul>Why are blank nodes so hard to get right?
- 20. <ul><li>What is missing in RDF concepts is something to capture the intuition that an RDF graph is like a node-arc diagram . (Not a 'mathematical' graph!) </li></ul><ul><li>RDF graphs are drawn on surfaces . Blank nodes are marks on the surface . Intuitively, think of a surface as a piece of paper, or a screen, or a document. </li></ul><ul><li>Surfaces provide the missing type/token distinction. Putting the same graph onto a new surface is like making a copy. But copying a graph onto a new surface always gets you new blank nodes, because a mark can only be on one surface . Aha! </li></ul>A blank node is a mark on a surface .
- 21. <ul><li>Formally . Take the RDF concepts as published, add a set of surfaces , disjoint from all the others, and a functional property of being on between blank nodes (call them marks for emphasis) and surfaces. Call the set of marks on a surface the graffiti of the surface. Define a graph to be a pair of an RDF graph G and a surface S such that the blank nodes of G are a subset of the graffiti of S. The triples of a graph are the triples of the RDF graph. We will say that the triples of the graph, and the URIs and literals which occur in the RDF graph are on the surface. </li></ul>A blank node is a mark , on a surface .
- 22. <ul><li>(From now on, 'graph' means RDF-graph + surface .) </li></ul><ul><li>A graph can have extra marks, but they don't mean anything so are harmless (technically, they say that something exists .) </li></ul><ul><li>A surface can have more than one graph on it, but a graph cannot be split over multiple surfaces. (Contrast RDF graph.) </li></ul><ul><li>Even with no blank nodes, each graph is on a single surface. </li></ul><ul><li>A copy of a graph <G, S> is a graph <G', S'> such that there is a 1:1 map m from the marks of S to those of S' and G'= m (G) </li></ul>A blank node is a mark, on a surface.
- 23. <ul><li>Surfaces make sense of RDF syntax, while keeping it abstract. They also provide a neat abstraction for some Webbish notions. </li></ul><ul><li>Surfaces provide the missing type/token distinction, and make sense of the ideas of copying and transmitting (= copying onto a distant surface) RDF graphs. </li></ul><ul><li>Surfaces get rid of the merge/union distinction. A conjunction of two graphs is a graph got by copying them both onto a single surface. (No need to "standardize apart") </li></ul><ul><li>Surfaces provide a way to define syntactic scope in RDF. Graphs have a natural 'boundary'. </li></ul><ul><li>The URI of a named graph identifies a graph. (Not an RDF graph!) </li></ul><ul><li>Surfaces provide a way to track 'dynamic' RDF graphs. The surface retains its identity through RDF graph changes. Makes sense of SPARQL "update". </li></ul><ul><li>Surfaces handily resolve tricky bnode-scoping issues e.g. in SPARQL. The query, the reference graph and the answers are all on distinct surfaces: end of story. </li></ul>Surfaces are a good idea.
- 24. <ul><li>Think colored paper. </li></ul><ul><li>Positive surfaces claim that an RDF graph on them is true. This is the current RDF default assumption. </li></ul><ul><li>Negative surfaces claim that an RDF graph on them is false. </li></ul><ul><li>Neutral surfaces simply make no claims at all about their graphs. (Good place to put eg. RDF collection triples in OWL/RDF.) </li></ul><ul><li>We can imagine others (deprecating surfaces?) but this will do for now. </li></ul>Kinds of surface. <ul><li>( If we only allow positive surfaces, this is just current RDF but with a cleaner conceptual model. ) </li></ul>
- 25. <ul><li>By allowing different kinds of surface, we can encode different assertional modes. For example, the surface can assert the graph or deny the graph or just display the graph without making claims about its truth either way. None of this changes the RDF semantics of RDF graphs! </li></ul><ul><li>Once we have denial and scoping, we have negation . RDF already has conjunction and the existential quantifier (blank nodes). This gives a graphical syntax for full first-order logic , if we have the freedom to combine them properly. </li></ul>Surfaces are a very good idea. <ul><li>Using a graph syntax for logic is one the oldest ideas (C.S.Peirce, 1885) and very well understood. http://www.flickr.com/photos/lilitupili/260552781/ </li></ul><ul><li>((p => a) & (q => b)) => ((p & q) => (a & b)) </li></ul>
- 26. <ul><li>Because RDF graphs retain their current RDF semantics, marks on a negative surface are more like universally quantified variables. </li></ul><ul><li>DeMorgan's law: (not (exists x ...)) = (forall x (not ...)) </li></ul>Kinds of surface. _:x rdf:type ex:oddities _:x rdf:type ex:oddities oddities exist not (oddities exist) everything is not an oddity
- 27. <ul><li>In order to get the full power of logic, we need a way to include surfaces inside other surfaces. </li></ul><ul><li>Extend the abstract RDF-surface model to allow surfaces, as well as nodes and triples, to be on a surface. </li></ul><ul><li>A finite set of surfaces tree-ordered by on is a codex . Extending RDF to allow graphs on codices instead of (simple) surfaces makes it into Pierce conceptual graph notation, giving it the power of full FOL (in fact, of ISO Common Logic.) </li></ul>Surfaces on surfaces: RDF codices.
- 28. Surfaces on surfaces: RDF codices. <ul><li>Every city is a human community. </li></ul><ul><li>Some non-city is a human community. </li></ul>
- 29. Surfaces on surfaces: RDF codices. <ul><li>Putting RDF graphs on a codex requires that we are precise about exactly which surface each node of each triple in the graph is on . This is easy to do graphically: </li></ul><ul><li>Not ( exists something which is a City and Not (a HumanCommunity)) </li></ul><ul><li>Every City is a HumanCommunity </li></ul><ul><li>ex:City rdfs:subClassOf ex:HumanCommunity . </li></ul>
- 30. Surfaces on surfaces: RDF codices. <ul><li>ex:City rdfs:subClassOf ex:HumanCommunity . </li></ul><ul><li>This graph now has its RDFS meaning in RDF already . The RDF semantics defines the RDFS meaning. It is not a "semantic extension", and there is no layering involved, only abbreviation, AKA syntactic sugar. </li></ul><ul><li>With just this much extra apparatus, RDF is all the logic we need. </li></ul>
- 31. <ul><li>Graphical convention (used already): an RDF triple is attached to a surface by its property arc label. The subject and object nodes might be on other surfaces. </li></ul>Surfaces on surfaces: RDF codices.
- 32. <ul><li>Text convention: add 'surface parentheses' and explicit bnode binding syntax to Ntriples or Turtle. </li></ul>Surfaces on surfaces: RDF codices. <ul><li>%not[ _:x _:x rdf:type ex:city . %not[ _:x rdf:type ex:HumanCommunity . %] %] </li></ul>
- 33. Abbreviations may not be very easy to read, but they work. aaa rdfs:range bbb . ==>> %not[ _:x _:y _:x aaa _:y . %not[ _:y rdf:type bbb . %]] aaa is bbb owl:allValuesFrom ccc . ==>> %not[ _:x _:y _:x rdf:type aaa . _:x bbb _:y . %not[ _:y rdf:type ccc . %]] %not[ _:x %not[ _:y _:x bbb _:y . %not[ _:y rdf:type ccc . %]] %not[ _:x rdf:type aaa . %]]
- 34. Semantic OWL/RDF <ul><li>Currently, OWL has its semantics and so does RDF and this is a problem . </li></ul><ul><li>With surfaces, we can simply encode OWL meanings directly in RDF, using the RDF semantics rather than trying to avoid it. Then, OWL (and much of RIF) are simply organized collections of RDF abbreviations and restrictions. There is no layering and no extra semantics: the only requirement for the 'higher-level' specs is to define the 'upper' notations as syntactic sugar. </li></ul><ul><li>The RDF+surfaces conceptual model provides a single, universal interchange format for (nearly) all SWeb languages, with a single, uniform semantic model. A true blogic, in fact. </li></ul>
- 35. A bigger base for the layer cake. Some of RIF is outside normal logic. SPARQL is a law unto itself. The rest is (revized) RDF with syntactic sugar and restrictions.
- 36. Resources <ul><li>Piercian graphical logic has been widely used, see http://conceptualgraphs.org /, and even standardized (ISO 24707 App. B) . </li></ul><ul><li>John Sowa has been very active in this area, and I have used his ideas at key places. See http://www.jfsowa.com/cg/index.htm </li></ul>