INFORMATION SPACES AS A BASIS FOR PERSONALISING THE

Ian Oliver Nokia Research Center, It¨amerenkatu 11-13, Helsinki, Finland

Keywords: Space based computing, Semantic Web, Mobile devices.

Abstract: The future of the Semantic Web lies not in the ubiquity, addressability and global sharing of information but rather in localised, information spaces and their interactions. These information spaces will be made at a much more personal level and not necessarily adhere to globally agreed semantics and structures but rely more upon ad hoc and evolving semantic structures.

1 INTRODUCTION 2 PERSONALISATION AND SPACES In this paper we position our vision of the continu- ation of the development or evolution of the Seman- tic Web (Berners-Lee et al., 2001). This is best visu- The Semantic Web is succeeding in relatively small- alised as the Giant Global Graph concept popularised scale, specific situations which are restricted to a by Tim Berners-Lee1. given domain. If we expand the notion of a domain in Most information however is not ubiquitous but a more orthogonal sense to encompass personal level personalised, hidden, private and interpreted locally - then this suggests that we have a notion of a ‘Personal this information tends to be the personal, highly dy- Semantic Web’ in which one can organise their own namic information that one stores about oneself: con- information according to these principles. The advan- tact lists, friends, media files, ‘my’ current context, tages of a Semantic Web based approach is that cer- ‘my’ family, ‘my’ home etc and the interweaving and tain structures, schemata and semantics can be fixed linking between these entities through ad hoc personal enabling some - and this is an important point, we structures. should not (and can not?) try to attempt everything - We elaborate on the ideas of ubiquitous informa- meaningful communication, reasoning and interoper- tion, the role of reasoning and knowledge, the lo- ability to take place. cation of the information with relation to its ubiq- Mobile devices with various methods of connec- uity through the concept of projections from the Gi- tivity which now constitute for many as being the pri- ant Global Graph called spaces. We then describe an mary gateway to the internet and also being a ma- implementation of an environment supporting these jor storage point for much personal information (Ide- ideas in a mobile and personalcontextas well as many hen and Erling, 2008; Lassila and Adler, 2003). This of the issues that this directly brings up with regards is in addition to the normal range of personal com- to what are semantics and how information is going puters and furthermore sensor devices plus ‘internet’ to be dealt with in this context. based providers. Combining these devices together In the following sections we outline our position and lately the applications and the information stored and areas of research relating to notions of personali- by those applications is a major challenge of interop- sation, Semantic Web, informationand its meaing and erability (Tolk and Muguira, 2003; Turnitsa, 2005). semantics as well as our implementation. This is achieved through numerous, individual and personal spaces in which persons, groups of persons etc can place, share, interact and manipulate webs of information (Krummenacher, 2008; Khushraj et al., 2004) with their own locally agreed semantics with- 1htt p : //en.wikipedia.org/wiki/Giant Global Graph out necessarily conforming to an unobtainable, global

179 Oliver I. (2009). INFORMATION SPACES AS A BASIS FOR PERSONALISING THE SEMANTIC WEB. In Proceedings of the 11th International Conference on Enterprise Information Systems - Software Agents and Internet Computing, pages 179-184 DOI: 10.5220/0002155901790184 Copyright c SciTePress ICEIS 2009 - International Conference on Enterprise Information Systems

whole. These spaces are projections of the ‘Giant garding trust and security need to be addressed - we Global Graph’ in which one can apply semantics and do not specifically discuss this problem in this paper. reasoning at a local level. A detailed survey of such space-based systems is given in (Nixon et al., 2008). This approach we feel addresses at least two of the counter-arguments against the Semantic Web vision: 3 INTERACTION AND SHARING feasibility and privacy by directly addressing notions WITH SPACES of locality or ubiquity and ownership. Feasibility be- cause we are changing the problem to address much Consider the follow scenarios. In figure 1 Alice inter- smaller-scale structures through setting clear bound- acts with her personal space - through ‘agents’2 run- aries in terms of computation. ning on a multitude of devices. This space contains a In order to apply reasoning and other manipula- corpus of information A which through local reason- tions (such as sharing) of that information we are re- ing and deductive closure algorithms - a feature of our quired to construct processes which have access to spaces - provides her with the corpus R(A). Informa- that information - typically these are known as agents tion is represented using Semantic Web standards, ie: in the ‘traditional’ sense of the word although we RDF, RDFS, OWL, FOAF etc, rule sets in RuleML tend towards the classification given in (Haag et al., etc. 2003). Agents are either personal in that they per- form tasks either directly decided upon by the user or R(A) autonomously for or on behalf of the user, monitor interacting with A particular situations or reason/data-mine the existing uses information.

Personalisation is achieved through explicitly de- Alice marking a space in which information is stored and executing on agents have access. Within each space information is Alice’s "agents" organised according to the owner (or owners) of that space. For an agent to obtain entry to that space then it is made on the terms of that space. Similarly fortwo ...and others... spaces to interact directly similar contracts must also Figure 1: Alice’s Agents, Devices, Spaces and Information. hold. Interactions with spaces is described in section 3. In this case the boundary of R(A) is the limit of The kinds of information that are stored in a per- Alice’s personal space. If Alice has two spaces or sonal space vary but initially contacts lists, media files corpii of information she might bind these together to (links to media), personal information management produce a much larger space. These individual corpii data (calendars etc), email and other personal com- of information may be overlapping in terms of their munication etc. This easily expands to information content. Alice can interact simultaneously with many feeds such as those provided through RSS and even discrete spaces. These situations are visualised in fig- WWW interfaces, family or community information, ure 2; for simplicity we only show the spaces and clo- social networking and so on. These kinds of informa- sures. Here the total information available for a given tion can be then further augumented by tagging, inter- space is the union of the deductive closure over all the nal links and more sophisticated equivalence relation- individual corpii. ships such as might be seen between - ing contacts, contacts lists, calendars etc. In addition more static and thus more externalisable information R(D) D can be stored or referenced in the same manner - such A information might be census records, telephone direc- R(A u B) tories or even cultural information (Hyv¨onen et al., B 2008).

Of course there are issues regarding the interpre- R(C) C Alice tation of information and how the meaning or seman- tics is preserved across spaces and agents; this also includes deciding whether two independent structures Figure 2: Alice and Alice’s Spaces. actually represent the same piece of information and can be merged or coalesced. Furthermore issues re- 2Agent is rather a loaded word, but alternatives aren’t numer- ous: executives, nodes, UIs, programs, etc

180 INFORMATION SPACES AS A BASIS FOR PERSONALISING THE SEMANTIC WEB

Alice can decide to break and reconfigure her cur- the shared semantics of the information. rent spaces into many smaller spaces. This may be made in any manner including removing all informa- tion and creating multiple individual smaller or even A empty spaces to making a complete copies of the cur- C Alice Bob rent space. B We now introduce Bob, who has a space of his own that is constructed from a single corpus of infor- mation. At this point we can say nothing about the Figure 4: Alice’s and Bob’s (Merged) Space. relationship between the contents of the corpii A and B with C; they may potentially all contain the same This then constitutes how spaces are related but information. has not yet addressed certain specific ideas about in- Interaction between Alice and Bob can be made in formation and the semantics of that information and three different forms. The first is simple in that Bob these are discussed in section 4. only needs to give Alice’s ‘agents’ access to his space as visualised in figure 3. Bob of course has his own ideas about privacy and grants Alice access to only a portion of his space. Alice has direct access to a 4 INFORMATION subset of Bob’s space - if she has write access then AND SEMANTIC ISSUES potentially this could have an effect on the space as a whole. We can classify the issues with this approach as: Privacy is asymmetric - it is on the sharer’s terms • Non-monotonicity of Deductive Closure and only thus precluding the need for a globally agreed Rules privacy mechanism. If Alice just so happens to be able to satisfy the criteria for accessing Bob’s • Graph Provenance space then Alice is granted access at whatever level • Semantics of the Information Bob’s privacy mechanisms allow. Alice’s own privacy • Uncertainty, Incompleteness, Inconsistency and mechanisms do not affect Bob’s mechanisms and vice Undefinedness of Information versa. Given a single space s, the information contained in that space is i(s), the rules ρ(s) and the deductive closure calculated as R(i(s),ρ(s)). A merge of two A C spaces s1 and s2 results in a single space sm where sm is calculated as R i s ∪ i s δ ρ s ρ s . The Alice Bob ( ( 1) ( 2), ( ( 1), ( 2)) B function δ determines the set of rules to apply and is constructed from a mechanism which prioritises the rules somehow - the exact mechanism would of course vary but we envisage would be similar to those found in certain kinds of non-monotonic calculi, eg. Figure 3: Alice Interaction with Bob’s Space. (Mueller, 2006). Graph provenance and the related semantics The second form of interaction is a variation of problem are the major problems in any Semantic this: Bob to partitions off a given subspace to which Web/interoperability system as there, beyond pre- Alice has access, then any changes can be kept lo- agreed addressing and strict, standardised ontologies, cal and the merge back controlled by Bob explicitly. no definitive method for relating structures represent- In both of these cases access policy including trust ing the same information together exists. mechanisms are local to Bob - there is no need for While information about typing etc is carried Alice to know about what mechanisms are in place. within the space, deeper semantics is not. Identifi- The fist two forms we expect to be the most com- cation of larger meaningful structures such as RDF mon methods of interaction, the third offers a set of molecules (Ding et al., 2005) provide at this time different possibilities based around the merging of the strongest basis for provenance analysis and ad- the spaces. This is more complicated as Alice and dressing deeper semantically meaningful structures. Bob must both agree to the merge (fig. 4) both in In the most part we must rely upon local convention terms of personally agreeing through their trust mech- between any two merging or interacting spaces with anisms (might just be personal trust) but also through the hope that this leads to a more global convention

181 ICEIS 2009 - International Conference on Enterprise Information Systems

(Afraz Jaffri, 2008; Shafiq et al., 2008). much slower than the folksonomic cases. A fairly The meaning of the information to Alice might be common mechanism for agreeing on semantics is the very different to the meaning ascribed by Bob (see upper ontology approach, but again this suffers from also provenance above). The meaning or semantics the problem of many upper ontologies (for example: of the information can only be made by the reader (Hyv¨onen, 2008))- an interesting discussion of this is (Burcea et al., 2003); the writer of the information made in (Wheeler, 2004) only gives hints through typing and tagging and other Finally the problem of uncertain, incomplete, relationships to what the intended meaning might be. inconsistent and undefined information requires a This hints to the question how do we guaran- much more formal approach within the various agent tee that two agents understand the information in the and reasoning structures (Lassila, 2008). Within same way, our response to this is that we don’t care; the Semantic Web we must further explore notions at least to the point where there is no internal mech- of undefinedness, modality, probability and non- anism for this (Kim and Anseo-Dong, 2002). As it monotonicity. This is left for future work though is, the meaning of some ontological structure evolves mechanisms are already present within our imple- over time and there appearsto be no reasonable mech- mentation for attaching and modality properties. anism for communicatingdeeper level semantic struc- tures. For true, reliable communication how many semantic levels are required is unknown. However, 5 IMPLEMENTATION since that if access to a space is granted or a merge made then this is implicit agreement between the par- Supporting these ideas we already have the comput- ties and particularly the readers over the intended se- ing and networking infrastructure. Our particular mantics of the information. solution builds a space-based computing framework In (G¨ardenfors, 2000) is provided a detailed dis- (Oliver and Honkola, 2008; Oliver et al., 2008) based cussion of the style of intentional semantics (Kim and upon the Piglet/Wilbur (Lassila, 2007) RDF++ en- Anseo-Dong, 2002)we propose here that it is not just- gine (Lassila, 2002). The notion of space being con- ing typing but the whole construct of properties of an structed out of a number of individual, linked (totally object - and then the scope over which we define an routable) brokers. Interaction with the space is via a object - that must be taken into consideration when agents which may reside on any suitable device with deciding how an agent interprets a given structure. suitable connectivity and computing capabilities; sim- This also applies when dealing with the aforemen- ilarly the brokers. Figure 5 shows one possible con- tioned graph provenance issue. figuration. To complicate matters further, the notion of se- Agents may connect to one or more spaces at a mantics embodied within these kinds of information time and to which spaces may vary over the lifetime structures is little more than meta-data whereas one of an agent. Mobility in this sense is provided in really needs to describe a further relationship into a ‘pi-calculus’ manner (Milner, 1999) in that links the ‘real-world’ (Smith, 1996). Solutions based upon may move rather than the physical running process. lexical and semantic analysis through resources such Agents can save state and become ‘mobile’ when an- as Wordnet(Fellbaum, 1998) appear to be the most other agent restores that state. We have not addressed promising here with regard to issues surrounding se- code mobility in the current implementation and this mantics similarity (Jan Wielemaker and Wielinga, remains low priority at this moment. 2003; Ruotsalo and Hyv¨onen, 2007). However, Agents themselves are anonymous and indepen- despite this we can (an no current computer sys- dent of each other - there is no explicit control flow tem) never be sure that any two agents actually act other than that provided through preconditions to upon their respective interpretations information in agent actions. A coordination model based around ex- the same way. pressing coordination structures as first-order entities Currently we are seeing two mechanisms for se- is being investigated, however we are more focussed mantic agreement: the first is through standardisa- on collecting and reasoning over context. Control tion of ontologies (W3C) and the second is through flow can be made outside of the space through agents folksonomic evolution of initially personal and infor- explicitly sharing details of their external interfaces mal structures into ad hoc ontologies which become through the space - this has been successfully used in more concretised as social agreements form. Even in coordinating media streaming and storage devices via the strict, formal ontology development scenario evo- UPnP3 and NoTA4 for example. lution of the ontology takes place as usage changes and develops (Ruotsalo et al., 2008), however this is 3Universal Plug and Play http://upnp.org 4Network on Terminal Architecture http:// www.notaworld.org/

182 INFORMATION SPACES AS A BASIS FOR PERSONALISING THE SEMANTIC WEB

Potential explicit Control Flow Mechanisms

Agents + connections to spaces

Space "A" Space "B"

Individual Brokers + Information Stores

Figure 5: An Example Implementation Configuration.

The brokers each contain a corpus of information 6 CONCLUSIONS and when linked together to form a space distribute the information in an asymmetric manner - some in- In summary we believe that the Semantic Web will formation is not replicated because of computational move from being a global information corpus to mul- resources, connectivity, storage reasons and even le- tiple, individual, linked and personal corpii. Seman- gal issues such as copyright. This distribution layer tics, reasoning and processing about the information is also responsible for the efficient distributed com- will be localised and personalised within these corpii. putation of queries and marshalling the resultant re- As corpii are shared, linked, merged and split, certain sponses such that calculating the deductive closure schemata will coalesce and evolute into fixed or stan- can be made. In this manner we can distribute com- dard structures in an evolutionary form. plex computation away from the original agent over There are still questions regarding what precisely the whole space. is semantics and how this is preserved across informa- This distribution can be used in a number of ways tion structures but techniques do exist for reasoning and one of the most interesting for us is giving the about this and the related graph/information prove- user temporary access to a larger body of information nance problems and these are currently being imple- which can be used to selectively enhance their current mented and trialled within the framework we have de- corpus of information, for example, a body of linking scribed. information based around the owl:sameAs construct (Passant, 2008). Other examples include personal ac- cess to more dynamic corpii such as news, weather or REFERENCES similar services. We make no attempt to enforce consistency of the Afraz Jaffri, Hugh Glaser, I. M. (2008). Uri disambiguation information rather letting the writer of the informa- in the context of linked data. In Linked Data on the tion have freedom to express what they want and leave Web (LDOW 2008), Beijing, China. the interpretation to the reader. The semantics of the Berners-Lee, T., Hendler, J., and Lassila, O. (2001). The information is merely intensional in that the writer semantic web. Scientific American, 284(5):34–43. provides ‘clues’ through typing, tagging and other Burcea, I., Petrovic, M., and Jacobsen, H.-A. (2003). I know means. Repair of information according to schemata what you mean: semantic issues in internet-scale pub- lish/subscribe systems. In Cruz, I. F., Kashyap, V., or other criterion can be enforcedwithin the space and Decker, S., and Eckstein, R., editors, SWDB, pages for some kinds of information would even be desir- 51–62. able. If consistency of particular structures is required Ding, L., Finin, T., Peng, Y., Silva, P. P. D., and L, D. then this can be achieved through agent implementa- (2005). Tracking rdf graph provenance using rdf tion and specific belief revision models. molecules. Technical report, 2005, Proceedings of the Fourth International Semantic Web Conference. Fellbaum, C. (1998). Wordnet: An electronic lexical database.

183 ICEIS 2009 - International Conference on Enterprise Information Systems

G¨ardenfors, P. (2000). Conceptual Spaces: The geometry Mueller, E. T. (2006). Commonsense Reasoning. Morgan of thought. The MIT Press. 0-262-57219-2. Kaufmann. 0-12-369388-8. Haag, S., Cummings, M., and McCubbrey, D. J. (2003). Nixon, L. J. B., Simperl, E., Krummenacher, R., and Management Information Systems for the Information Martin-Recuerda, F. (2008). Tuplespace-based com- Age. McGraw-Hill Companies. 4th edition. 978- puting for the semantic web: a survey of the state- 0072819472. of-the-art. The Knowledge Engineering Review, Hyv¨onen, E. (2008). Finnonto-malli kansallisen semant- 23(2):181–212. tisen webin sis¨alt¨oinfrastruktuurin perustaksi - visio ja Oliver, I. and Honkola, J. (2008). Personal semantic web sen toteus (finnonto model as the basis for a national through a space based computing environment. In semantic web infrastructure - vision and its implemen- Middleware for Semantic Web 08 at ICSC’08, Santa tation). In Paper presented at the publication event of Clara, CA, USA. the Finnish Ontology Library Service ONKI. Oliver, I., Honkola, J., and Ziegler, J. (2008). Dynamic, lo- Hyv¨onen, E., M¨akel¨a, E., Kauppinen, T., Alm, O., Kurki, calised space based semantic webs. In WWW/Internet J., Ruotsalo, T., Sepp¨al¨a, K., Takala, J., Puputti, K., Conference, Freiburg, Germany. Kuittinen, H., Viljanen, K., Tuominen, J., Palonen, T., Passant, A. (2008). :me owl:sameas flickr:33669349@n00. Frosterus, M., Sinkkil¨a, R., Paakkarinen, P., Laitio, J., In Linked Data on the Web (LDOW 2008), Beijing, and Nyberg, K. (2008). Culturesampo – a collective China. memory of finnish cultural heritage on the semantic web 2.0. Ruotsalo, T. and Hyv¨onen, E. (2007). A method for de- Idehen, K. and Erling, O. (2008). Linked data spaces and termining ontology-based semantic relevance. In Pro- data portability. In Linked Data on the Web (LDOW ceedings of the International Conference on Database and Expert Systems Applications DEXA 2007, Re- 2008), Beijing, China. gensburg, Germany. Springer. Jan Wielemaker, G. S. and Wielinga, B. (2003). Prolog- based infrastructure for rdf: performance and scala- Ruotsalo, T., Sepp¨al¨a, K., Viljanen, K., M¨akel¨a, E., Kurki, bility. In In: D. Fensel, K. Sycara and J. Mylopou- J., Alm, O., Kauppinen, T., Tuominen, J., Frosterus, los (eds.) The Semantic Web - Proceedings ISWC’03, M., Sinkkil¨a, R., and Hyv¨onen, E. (2008). Ontology- Sanibel Island, Florida. Lecture Notes in Computer based approach for interoperability of digital collec- Science, volume 2870, Springer-Verlag, pages 644– tions. Signum, (5). 658. Shafiq, O., Scharffe, F., Wutke, D., and del Valle, G. T. Khushraj, D., Lassila, O., and Finin, T. (22-26 Aug. 2004). (2008). Resolving data heterogeneity issues in open stuples: semantic tuple spaces. Mobile and Ubiqui- distributed communication middleware. In Proceed- tous Systems: Networking and Services, 2004. MO- ings of 3rd International Conference on Internet and BIQUITOUS 2004. The First Annual International Web Applications and Services (ICIW 2008), Athens, Conference on, pages 268–277. Greece. Kim, H.-G. and Anseo-Dong (2002). Pragmatics of the Smith, B. C. (1996). On the Origin of Objects. The MIT semantic web. In Semantic Web Workshop. Hawaii, Press. 0-262-69209-0. USA. Tolk, A. and Muguira, J. A. (2003). The levels of conceptual Krummenacher, R. (2008). The smartest space of all: A interoperability model (lcim). In Proceedings IEEE global space of (machine-understandable) knowledge. Fall Simulation Interoperability Workshop, IEEE CS In 1st Russian Conference on SmartSpaces, ruSmart Press. 2008, St.Petersburg, Russia. Turnitsa, C. D. (2005). Extending the levels of conceptual Lassila, O. (2002). Taking the rdf model theory out for a interoperability model. In Proceedings IEEE Summer spin. In ISWC ’02: Proceedings of the First Inter- Computer Simulation Conference, IEEE CS Press. national Semantic Web Conference on The Semantic Wheeler, Q. D. (2004). Taxonomic triage and the poverty Web, pages 307–317, London, UK. Springer-Verlag. of phylogeny. Lassila, O. (2007). Programming Semantic Web Applica- tions: A Synthesis of Knowledge Representation and Semi-Structured Data. PhD thesis, Helsinki Univer- sity of Technology. Lassila, O. (2008). Some personal thoughts on semantic web and non-symbolic ai. In 4th International Work- shop on Uncertainty Reasoning for the Semantic Web. Lassila, O. and Adler, M. (2003). Semantic gadgets: Ubiq- uitous computing meets the semantic web. In Fensel, D., Hendler, J. A., Lieberman, H., and Wahlster, W., editors, Spinning the Semantic Web: Bringing the to Its Full Potential, pages 363–376. MIT Press. 0-26206-232-1. Milner, R. (1999). Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press. 0-521- 65869-1.

184