PhD scholardship in Saint-Étienne within Marie Skłodowska-Curie training network WDAqua
PhD studentship proposal Université Jean Monnet in Saint-Étienne (France), part of the larger Université de Lyon, is looking for 1 full-time PhD student in the domain of Semantic Web, Linked data, Internet Science The position is offered in the frame of the EU-funded Marie Skłodowska-Curie International Training Network WDAqua (Answering Questions using Web Data). http://wdaqua.informatik.uni-bonn.de/ Topics of the PhD will cover the domains of provenance, trust, link discovery, and reasoning. == Essential Facts == The PhD student will spend 3 years working in the WDAqua ITN (a total of 15 PhD students registered in the Universities of Bonn, Athens, Saint-Étienne, and Southampton). He/She will participate in an outstanding web science and data science training programme, and will have the chance to visit other partners. A double PhD degree with the University of Bonn is planned with this position. The gross monthly salary (including all employer taxes, social security charges, before taxes) is about €3,452/month per students (it corresponds to approximately a €2,400/months gross salary). A mobility allowance of 600€/month and, if applicable, a family allowance of 500 €/month are also provided. == Timeline == July 1st, 2015: application deadline Sept2015–August 2018: duration of a PhD in WDAqua == Eligibility and application procedure == Candidates must not have resided for more than 12 months in France in the 3 years before starting. They must hold a MSc degree in computer science or a related field and be able to combine both theoretical and practical aspects in their work. Fluent English communication and a passion for developing modern software solutions are fundamental requirements. Command of French or German is a plus but not required. The candidates should have experience and commitment to work in team and on the forefront of research. You will need to submit by email a CV, university transcripts, a motivation letter including a short research plan targeting some topics of the above list, two letters of recommendation, and English writing samples (e.g., prior publication or master thesis excerpt). The Université Jean Monnet is an equal opportunities employer. Preference will be given to suitably qualified women or persons with disabilities, all other considerations being equal. == Contact == Pierre Maret and Antoine Zimmermann (Laboratoire Hubert Curien, Saint-Étienne, Connected Intelligence team https://connected-intelligence.univ-st-etienne.fr/) pierre.ma...@univ-st-etienne.fr, antoine.zimmerm...@emse.fr -- Antoine Zimmermann ISCOD - Institut Henri Fayol École des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: PhD studentship on French national project OpenSensingCity (deadline extended)
Sorry if you receive this call several times. We extended the deadline for application: now *30th of May*. == PhD studentship on French national project OpenSensingCity == École des Mines de Saint-Étienne, France is seeking a talented student in order to work on ANR-funded project OpenSensingCity. The project aims at fostering the usage of real time open data in the context of smart cities by providing operating tools helping application developpers to take advantage of open data streams as easily as possible. The student will work on an information model for smart city data streams that involves the construction of an ontology. The student will also work on the definition of a query language that supports high level operations that are typical to the needs of smart city applications, such as aquiring data according to a postal address or type of amenities. To this aim, we expect a student that has a master degree in computer science with knowledge in the field of semantic web and linked data. Additionally, familiarity with query languages, data management, stream processing, logics and knowledge representation are all desirable assets. The student should be confortable with formal approaches but also capable of implementing their contribution. The studentship is contracted with ARMINES and the net salary (after taxes) is about €1670. The student will be part of a research team in Laboratoire Hubert Curien [1], a multi-site laboratory in Saint-Étienne, and Institut Henri Fayol [2], a multi-disciplinary center of École des Mines de Saint-Étienne. Our research group is working on open, distributed, cooperative systems, such as the Web and the Semantic Web, multi-agent systems, or virtual communities. Applications should be sent to Antoine Zimmermnann and Olivier Boissier (see addresses below) with a CV, a letter of motivation, university transcripts and optionally recommendation letters before the *30th of May*. Contact: Antoine Zimmermann (antoine.zimmerm...@emse.fr) Olivier Boissier (olivier.boiss...@emse.fr) [1] http://laboratoirehubertcurien.fr/ [2] http://fayol.mines-stetienne.fr/ -- Antoine Zimmermann ISCOD - Institut Henri Fayol École des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Web Intelligence Summer School, Question Answering with the Web
Sorry for cross-posting. Web Intelligence Summer School 31 August - 4 September 2015 Saint-Étienne, France https://wiss.univ-st-etienne.fr/ Sharing, connecting, managing, analyzing and understanding data on the Web will enable better services for citizens, communities and industry. However, turning web data into successful services for the public and private sector requires skilled web and data scientists, and it still requires further research. In order to teach and train researchers and to create exchange opportunities, the Web Intelligence community in Rhône-Alpes and Universität Bonn are bringing together experts on these aspects of the Web. The 2015 edition of the Web Intelligence Summer School (WISS) is called "Question answering based on web data". We will bring together experts on various aspects directly related to this question: -publication of web data (linked data, semantic web standards and techniques), -understanding and analyzing a question in natural language (NLP), -finding data to answer the question and to justify the answer (information retrieval, data management, machine learning, data integration/curation/extraction), -presenting the answers (visual analytics). During the week of the 31th of August to the 4th of September 2015, students will learn from formal presentations** and hands-on sessions** that will make them scientifically and practically competent. ** Important dates ** Opening of Application for participation (on the web site): March 2014. Deadline for application. 1 June 2015. Notification of acceptance. 15 June 2015. Deadline for registration. 10 July 2015. Summer school. 31 August - 4 September 2015. -- Antoine Zimmermann ISCOD - Institut Henri Fayol École des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
PhD studentship on French national project OpenSensingCity
Sorry if you receive this call several times. == PhD studentship on French national project OpenSensingCity == École des Mines de Saint-Étienne, France is seeking a talented student in order to work on ANR-funded project OpenSensingCity. The project aims at fostering the usage of real time open data in the context of smart cities by providing operating tools helping application developpers to take advantage of open data streams as easily as possible. The student will work on an information model for smart city data streams that involves the construction of an ontology. The student will also work on the definition of a query language that supports high level operations that are typical to the needs of smart city applications, such as aquiring data according to a postal address or type of amenities. To this aim, we expect a student that has a master degree in computer science with knowledge in the field of semantic web and linked data. Additionally, familiarity with query languages, data management, stream processing, logics and knowledge representation are all desirable assets. The student should be confortable with formal approaches but also capable of implementing their contribution. The studentship is contracted with ARMINES and the net salary (after taxes) is about €1670. The student will be part of a research team in Laboratoire Hubert Curien [1], a multi-site laboratory in Saint-Étienne, and Institut Henri Fayol [2], a multi-disciplinary center of École des Mines de Saint-Étienne. Our research group is working on open, distributed, cooperative systems, such as the Web and the Semantic Web, multi-agent systems, or virtual communities. Applications should be sent to Antoine Zimmermnann and Olivier Boissier (see addresses below) with a CV, a letter of motivation, university transcripts and optionally recommendation letters before the 30th of April. Contact: Antoine Zimmermann (antoine.zimmerm...@emse.fr) Olivier Boissier (olivier.boiss...@emse.fr) [1] http://laboratoirehubertcurien.fr/ [2] http://fayol.mines-stetienne.fr/ -- Antoine Zimmermann ISCOD - Institut Henri Fayol École des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: Will or can academic publisher's accept submissions in HTML-and-friends?
Maybe you should join the W3C Digital Publishing Interest Group and ask what they think there. http://www.w3.org/dpub/IG/wiki/Main_Page They have a public mailing list: http://lists.w3.org/Archives/Public/public-digipub-ig/ AZ Le 05/03/2015 11:18, Sarven Capadisli a écrit : Hi, I have a question: Will or can academic publisher's accept submissions in HTML-and-friends? It would be great to hear from our colleagues at academic publishing companies. Any and all of your responses are most welcome. That is, it does not have to be an official statement nor formal in any way. This is a friendly ping :) Looking forward to your responses. -Sarven http://csarven.ca/#i
3 PhD studentship in Saint-Étienne on project WDAqua
Apologise for cross-posting. === Université Jean Monnet (member of Université de Lyon) in Saint-Étienne, France is offering 3 full-time PhD students in the field of Semantic Web, Linked Data, and Web Science. === These positions are offered in the frame work of the EU-funded Marie Skłodowska-Curie International Training Network WDAqua (Answering Questions using Web Data). See more job offerings at http://www.iai.uni-bonn.de/~langec/wdaqua/. The topics of the PhDs will cover the domains of provenance, trust, link discovery, data dynamicity and evolution, temporal information, named entity recognition, disambiguation, and reasoning. == Essential facts == The 3 PhD students will spend 3 years working in the WDAqua ITN (a total of 15 PhD students registered in the Universities of Bonn, Athens, Saint-Étienne, and Southampton). They will participate in an outstanding web science and data science training programme, and will have the chance to visit other partners. The total salary allowance for the university is €3,452.1/month per students (including employer taxes), which corresponds to approximately a €2,400/months gross salary. In addition, a mobility allowance of 600 €/month and, if applicable, a family allowance of 500 €/month will be provided. Two of the positions have a dual degree with the University of Bonn in Germany. == Timeline == 27 February 2015: application deadline March 2015: first job offers made to successful applicants July 2015 – June 2018: duration of doctoral studies in WDAqua == Background == Smart infrastructures and citizens'participation in the digital society are increasingly data-driven. Sharing, connecting, managing, analysing and understanding data on the Web will enable better services for citizens, communities and industry. However, turning web data into intelligent and successful services for the public and private sector requires skilled web and data scientists, and it requires further research. WDAqua aims at advancing the state of the art by intertwining training, research and innovation efforts, centered on data-driven question answering. Question answering is immediately useful to a wide audience of end users, and we will demonstrate this in settings including e-commerce, public sector information, publishing and smart cities. Steps to answering a question are (1) understanding a spoken question, (2) analysing the question's text, (3) finding data to answer the question, and (4) presenting the answer(s). Every individual research project in WDAqua connects at least two of these steps. == Eligibility and application procedure == Candidates must not have resided for more than 12 months in France in the 3 years before starting. They must hold an MSc degree in computer science or a related field and be able to combine both theoretical and practical aspects in their work. Fluent English communication and a passion for developing modern software solutions are fundamental requirements. Command of French or German is a plus but not required. The candidates should have experience and commitment to work in team and on the forefront of research. You will need to submit a CV, university transcripts, a motivation letter including a short research plan targeting some topics of the above list, two letters of recommendation, and English writing samples (e.g., prior publication or master thesis excerpt). Université Jean Monnet is an equal opportunities employer. Preference will be given to suitably qualified women or persons with disabilities, all other considerations being equal. == Contact == Pierre Maret (pierre.ma...@univ-st-etienne.fr) Antoine Zimmerman (antoine.zimmerm...@emse.fr) Laboratoire Hubert Curien, UMR CNRS 5516, Bâtiment F 18 Rue du Professeur Benoît Lauras 42000 Saint-Étienne FRANCE -- Antoine Zimmermann ISCOD - Institut Henri Fayol École des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: Encoding an incomplete date as xsd:dateTime
Le 26/06/2014 12:06, Svensson, Lars a écrit : Simon, all, There's already a slight problem in vCard's treatment of bday; it includes xsd:gYear, which is not permitted in OWL2-DL, and it does not include xsd:string, which is available, and which is required by the RFC. If I declare the use of xsd:gYear in my ontology, can I use it then? I'm not familiar enough with OWL to answer that question myself, but the way I read §9.4 of the OWL syntax [1] I can use any datatype. Can someone more familiar with this topic shed some light on this? In OWL 2 DL, you can't declare any term in the xsd:, rdf:, rdfs: and owl: namespaces, according to the spec. Even if you could, you would not be able to define xsd:gYear because any datatype must be either an OWL-compatible datatype (see Section 4.1 of the structural spec), the special datatype rdfs:Literal, or a custom datatype that is built from unions, intersections, enumerations, complements of, or restrictions of already defined datatypes (See Section 5.2 and Section 7). With these constructs, you would never be able to define the value space of gYear, which is disjoint from all OWL-compatible datatypes. Now, you can still use xsd:gYear if you want because OWL 2 DL processors do not have to reject all non-compliant ontologies. Actually, most OWL processors would not bother much about gYear. Besides, these restrictions are for OWL 2 DL ontologies but the OWL specs also specify OWL Full ontologies, which are all valid RDF graphs. Depending on what tools you expect to be used on your ontology, the restrictions might be irrelevant. OWL2-DL allows for facets on dataTime to specify a minimum and maximum time point value, which can be used in restrictions on individuals to yield the appropriate models; however, this approach is not ideal. What would an ideal approach look like? My suggestion would be one of two ways: 1. use xsd:gYear in spite of the spec's restriction; or 2. use xsd:integer. Although gYear is formally disjoint from integer, in practice they are almost treated exactly in the same way. AZ. [1] http://www.w3.org/TR/owl2-syntax/#Datatype_Definitions Thanks, Lars
Keynote speakers at the Web Intelligence Summer School on the Web of Data (deadline for application 30/05)
Dear all, The Web Intelligence Summer School gives you the chance to see top-level actors of the Web of Data deliver inspiring speechs. In case you are interested in attending, please register at: http://ecole.web-intelligence-rhone-alpes.org/Registration Here are the keynotes speaker: - Stefan Decker, director of Insight Galway (formerly DERI) and full professor at the National University of Ireland, Galway, one of the most highly cited authors in the field of Web data and Semantic Web, will deliver the introductory talk at the Summer School. - Sören Auer, full professor at University Bonn and researcher at Fraunhofer, leader of the EIS group and previously leader and founder of the AKSW group at University Leipzig. He is also leading the steering committee of the European Data Forum. - Markus Krötzsch, group leader at University Dresden, co-creator and maintainer of Semantic Media Wiki, developer of the Wikidata project, will be speaking of Wikidata, the most amazing project from the Wikimedia foundation since Wikipedia itself! - Eric Prud'hommeaux, sanitation engineer at the W3C, who contributed to the development of many of the data-related Web standards, will speak about the role of the W3C in building the Web of Data and how it revolutionises clinical data. You can also find the programme at: http://ecole.web-intelligence-rhone-alpes.org/Programme and the complete list of speakers, instructors and tutors at: http://ecole.web-intelligence-rhone-alpes.org/Committee -- Antoine Zimmermann ISCOD - Institut Henri Fayol École nationale supérieure des mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Web Intelligence Summer School on The Web of Data
don't hesitate to forward to your colleagues and to other mailing lists = Web Intelligence Summer School - The Web of Data 25th-29th August, 2014 Saint-Étienne, France http://ecole.web-intelligence-rhone-alpes.org/ == Data is no longer an asset that only companies and organisations deal with. Recently, Web data has become crucial to our daily life. Open data is transforming institutions, people are sharing increasingly private and sensitive data on social networks, access to web APIs facilitates application development, and linked data is changing the Web into a huge database. The Web of Data is thus complementing the existing Web of multimedia documents, the Social Web and the Web of Applications. In this situation everybody should be aware of data management, manipulation, access and visualisation. During one week, the Web Intelligence community in Rhône Alpes and Universität Bonn will bring together Web of Data experts who will equip the participants with scientific and practical competence via lectures and hands-on sessions, enabling them to contribute to and take advantage of the full potential of the Web of Data. Important Dates === * Opening of application for participation: 15 March 2014 * End of application: 30 May 2014 * Notification of acceptance: 7 June 2014 * Deadline for registration: 30 June 2014 * Summer school: 25-29 August 2014 Programme overview == The programme will alternate between keynote speakers, technical lectures, hands-on sessions, and social events. We want to focus on practical work and guarantee that at least half of the tutorials will be dedicated to the hands-on sessions. A poster session will be organised where students will have the opportunity to present their own work. Topics of the lectures are: * Keynote, Sören Auer (Universität Bonn / Fraunhofer) * Publishing Web Data Christoph Lange (Universität Bonn / Fraunhofer) * The Web of Data at the W3C, Eric Prud'hommeau (W3C) * Querying Web Data, Axel Polleres (WU Wien) * Provenance on the Web, Paul Groth (VU Amsterdam) * Wikidata, Markus Krötzsch (TU Dresden) * Privacy in the Web of Data, Mathieu d'Aquin (MKi, Open University) * Visualisation and HCI, Aba-Sah Dadzie (University of Birmingham) Complete and always updated view on the programme is available on the homepage. http://ecole.web-intelligence-rhone-alpes.org/ Attendance == We welcome international participants. In case we receive more than the 50 applications we can host, we will select attendees based on their CVs and motivation. The participation fee will be €300 for students and €400 otherwise. A limited number of free registrations is available for students having financial difficulties and who can prove that participation will be beneficial to them. Registration is open. http://ecole.web-intelligence-rhone-alpes.org/Registration Organisation committee ====== Antoine Zimmermann, École des mines de St-Étienne (chair) Sören Auer, Universität Bonn / Fraunhofer IAIS Philippe Beaune, École des mines de St-Étienne Jérôme David, Université Pierre-Mendès France Frédérique Laforest, Université Jean Monnet, Télécom Saint Étienne Christoph Lange, Universität Bonn, Fraunhofer IAIS Pierre Maret, Université Jean Monnet Xavier Serpaggi, École des mines de St-Étienne Thomas Steiner, Université de Lyon / Google Hamburg
PhD Position at EMSE St-Etienne (second call)
Dear all, Please forgive us if you receive multiple copies of this email. A PhD studentship is available at ENS Mines Saint-Etienne. The deadline to apply is *7th of May*. He/she will be supervised by Professor Flavien Balbo and assistant Professor Antoine Zimmermann (ISCOD team, iscod.emse.fr). Scientific context: Intelligent transportation systems (ITS) aims at improving public transports, logistics and traffic management by utilising new hardware infrastructures (such as, sensors and communication networks) with modern information technologies for simulation, real-time control, data and knowledge management and exploitation. This opens new issues for the collection, storage and distribution of information related to travellers and goods. More specifically, information sources and services are numerous, multi-scale, heterogeneous and independent. As an example, recommending a multimodal route demands access to data and services that belong to independent operators, and that are difficult to combine. Therefore, one of the major objectives of ITS is to propose an adapted answer to the needs and dynamic context of travalers, thanks to a combined use of multiple services, data sources and partially formalised knowledge. Doctoral issue: In this context, the goal of this PhD thesis is the design of a generic framework to collect and share information and services in the transportation domain. Information and services are proposed by multiple operators in order to offer flexible and adapted advanced services to the travelers. The resulting middleware has to process heterogeneous and multi-scale information. The middleware design will be based on multi-agent and semantic web technologies. More precisely, the design of the shared information space will exploit open ontologies and linked data to integrate and to access heterogeneous and distributed data or service sources. The explicitation and context awareness of users will be based on the research of the ISCOD team and will be adapted to the transportation domain. Finally, the deployment of the middleware in an open and distributed environment will benefit from the research on interaction and coordination models in the multi-agent domain with the integration of the mobility dimension. Additional Information: The ISCOD laboratory belongs to the Henri Fayol institute that is a Joint Research Unit (JRU) of ARMINES and its partner school ENS Mines Saint-Etienne that deals with industrial management, systems engineering and information technology. Its objectives are to develop and explore advanced methods, models and tools to improve the overall performance of organisations, companies, and businesses, from both social responsibility and sustainable development perspectives. One of its research activities contribute to the development of a transparent and intelligent mediation infrastructure between the strongly interconnected digital world (contents and services) and real world (things and people). The models, technologies and applications that are developed within the group address the challenges of Decentralisation, Cooperation and Openness that are at the core of current ITs application (Web intelligence, Ambient Computing). The main research subjects investigated are multi-agent-oriented computing, information retrieval, semantic technologies, trust and privacy, artificial intelligence. Candidate Profile: The ideal candidate should have an MSc or equivalent degree in computer science or mathematics and should be able to work in a collaborative environment. Background knowledge and/or previous experience in the following areas, will be considered favorably: - Multi-agent System, - Semantic Web, - Software engineering. Contact: Email the following documents: - CV, - Motivation letter, - A copy of your grades of the last year or years (especially the current year if you are a Master student), if you do not yet have the official paper for the current year, please send us the grades by email and you will be able to provide the official paper later, - optionally, letters of recommendation to: - Flavien Balbo : Flavien [dot) Balbo [at) emse (dot] fr - Antoine Zimmermann : Antoine (dot] Zimmermann (at] emse [dot) fr Best Regards -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: Five Stars of Linked Data Vocabulary Use
It has some connections with something I wrote 4 years ago: http://ceur-ws.org/Vol-596/paper-12.pdf (it's just 5 pages LNCS style) AZ. Le 11/04/2014 03:45, Pascal Hitzler a écrit : An opinion piece re. linked data quality and reusability: http://www.semantic-web-journal.net/content/five-stars-linked-data-vocabulary-use (Semantic Web journal) All comments and feedback welcome. Best Regards, Pascal. -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
PhD Position at école des mines de Saint-Étienne
Dear All Firstly, apologies for cross posting. A PhD studentship is available at ENS Mines Saint-Étienne. He/she will be supervised by Professor Flavien Balbo and assistant Professor Antoine Zimmermann (ISCOD team, iscod.emse.fr). Scientific context: Intelligent transportation systems (ITS) aims at improving public transports, logistics and traffic management by utilising new hardware infrastructures (such as, sensors and communication networks) with modern information technologies for simulation, real-time control, data and knowledge management and exploitation. This opens new issues for the collection, storage and distribution of information related to travellers and goods. More specifically, information sources and services are numerous, multi-scale, heterogeneous and independent. As an example, recommending a multimodal route demands access to data and services that belong to independent operators, and that are difficult to combine. Therefore, one of the major objectives of ITS is to propose an adapted answer to the needs and dynamic context of travalers, thanks to a combined use of multiple services, data sources and partially formalised knowledge. Doctoral issue: In this context, the goal of this PhD thesis is the design of a generic framework to collect and share information and services in the transportation domain. Information and services are proposed by multiple operators in order to offer flexible and adapted advanced services to the travelers. The resulting middleware has to process heterogeneous and multi-scale information. The middleware design will be based on multi-agent and semantic web technologies. More precisely, the design of the shared information space will exploit open ontologies and linked data to integrate and to access heterogeneous and distributed data or service sources. The explicitation and context awareness of users will be based on the research of the ISCOD team and will be adapted to the transportation domain. Finally, the deployment of the middleware in an open and distributed environment will benefit from the research on interaction and coordination models in the multi-agent domain with the integration of the mobility dimension. Additional Information: The ISCOD laboratory belongs to the Henri Fayol institute that is a Joint Research Unit (JRU) of ARMINES and its partner school ENS Mines Saint-Etienne that deals with industrial management, systems engineering and information technology. Its objectives are to develop and explore advanced methods, models and tools to improve the overall performance of organisations, companies, and businesses, from both social responsibility and sustainable development perspectives. One of its research activities contribute to the development of a transparent and intelligent mediation infrastructure between the strongly interconnected digital world (contents and services) and real world (things and people). The models, technologies and applications that are developed within the group address the challenges of Decentralisation, Cooperation and Openness that are at the core of current ITs application (Web intelligence, Ambient Computing). The main research subjects investigated are multi-agent-oriented computing, information retrieval, semantic technologies, trust and privacy, artificial intelligence. Candidate Profile: The ideal candidate should have an MSc or equivalent degree in computer science or mathematics and should be able to work in a collaborative environment. Background knowledge and/or previous experience in the following areas, will be considered favorably: - Multi-agent System, - Semantic Web, - Software engineering. Contact Email CV and motivation letter to - Flavien Balbo : Flavien [dot) Balbo [at) emse (dot] fr - Antoine Zimmermann : Antoine (dot] Zimmermann (at] emse [dot) fr -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/ --- Ce courrier électronique ne contient aucun virus ou logiciel malveillant parce que la protection avast! Antivirus est active. http://www.avast.com
Application open for the Web Intelligence Summer School on The Web of Data
[We apologies to those who receive this announcement multiple times.] The application form for the Web Intelligence Summer School on The Web of Data (WISS 2014) has been published [1]. A pre-programme has been published too [2]. The summer school will culminate in a hackathon where participants will develop Web applications using and producing Web data. Moreover, in the spirit of open collaboration, the applications and data produced during the summer school will be made available to the organisers of the ESWC Summer School that will take place the following week in Crete [3]. [1] WISS 2014 application form. http://ecole.web-intelligence-rhone-alpes.org/Registration [2] WISS 2014 pre-programme. http://ecole.web-intelligence-rhone-alpes.org/Programme [3] ESWC Summer School 2014. http://summerschool2014.eswc-conferences.org/ = Web Intelligence Summer School - The Web of Data 25th-29th August, 2014 Saint-Étienne, France http://ecole.web-intelligence-rhone-alpes.org/ == Data is no longer an asset that only companies and organisations deal with. Recently, Web data has become crucial to our daily life. Open data is transforming institutions, people are sharing increasingly private and sensitive data on social networks, access to web APIs facilitates application development, and linked data is changing the Web into a huge database. The Web of Data is thus complementing the existing Web of multimedia documents, the Social Web and the Web of Applications. In this situation everybody should be aware of data management, manipulation, access and visualisation. During one week, the Web Intelligence community in Rhône-Alpes and Universität Bonn will bring together Web of Data experts who will equip the participants with scientific and practical competence via lectures and hands-on sessions, enabling them to contribute to and take advantage of the full potential of the Web of Data. Important Dates === * Opening of application for participation: 15 March 2014 * End of application: 30 May 2014 * Notification of acceptance: 7 June 2014 * Deadline for registration: 30 June 2014 * Summer school: 25-29 August 2014 Programme overview == Expected topics are: * publishing and organising Web data * querying and structuring Web data * reasoning on the Web of data * mining the Web of data * visualising the Web of data * protecting data in the Web of data We will gradually complete the programme information on the homepage as soon as the speakers confirm their attendance. Speakers have been invited from the best known institutions in the field, in order to ensure highest quality in content and pedagogy. In the meantime, feel free to send us any enquiries by email. Attendance == We welcome international participants. In case we receive more than the 50 applications we can host, we will select attendees based on their CVs and motivation. The participation fee will be €300 for students and €400 otherwise. A limited number of free registrations is available for students having financial difficulties and who can prove that participation will be beneficial to them. Organisation committee == Antoine Zimmermann, École des mines de St-Étienne (chair) Sören Auer, Universität Bonn / Fraunhofer IAIS Philippe Beaune, École des mines de St-Étienne Jérôme David, Université Pierre-Mendès France Frédérique Laforest, Université Jean Monnet, Télécom Saint Étienne Christoph Lange, Universität Bonn, Fraunhofer IAIS Pierre Maret, Université Jean Monnet Xavier Serpaggi, École des mines de St-Étienne Thomas Steiner, Université de Lyon / Google Hamburg -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/ --- Ce courrier électronique ne contient aucun virus ou logiciel malveillant parce que la protection avast! Antivirus est active. http://www.avast.com
[ANN] Web Intelligence Summer School on The Web of Data
[We apologies to those who receive this announcement multiple times.] = Web Intelligence Summer School - The Web of Data 25th-29th August, 2014 Saint-Étienne, France http://ecole.web-intelligence-rhone-alpes.org/ == Data is no longer an asset that only companies and organisations deal with. Recently, Web data has become crucial to our daily life. Open data is transforming institutions, people are sharing increasingly private and sensitive data on social networks, access to web APIs facilitates application development, and linked data is changing the Web into a huge database. The Web of Data is thus complementing the existing Web of multimedia documents, the Social Web and the Web of Applications. In this situation everybody should be aware of data management, manipulation, access and visualisation. During one week, the Web Intelligence community in Rhône Alpes and Universität Bonn will bring together Web of Data experts who will equip the participants with scientific and practical competence via lectures and hands-on sessions, enabling them to contribute to and take advantage of the full potential of the Web of Data. Important Dates === * Opening of application for participation: 15 March 2014 * End of application: 30 May 2014 * Notification of acceptance: 7 June 2014 * Deadline for registration: 30 June 2014 * Summer school: 25-29 August 2014 Programme overview == Expected topics are: * publishing and organising Web data * querying and structuring Web data * reasoning on the Web of data * mining the Web of data * visualising the Web of data * protecting data in the Web of data We will gradually complete the programme information on the homepage as soon as the speakers confirm their attendance. Speakers have been invited from the best known institutions in the field, in order to ensure highest quality in content and pedagogy. In the meantime, feel free to send us any enquiries by email. Attendance == We welcome international participants. In case we receive more than the 50 applications we can host, we will select attendees based on their CVs and motivation. The participation fee will be €300 for students and €400 otherwise. A limited number of free registrations is available for students having financial difficulties and who can prove that participation will be beneficial to them. We will soon announce the possibility to register. Organisation committee == Antoine Zimmermann, École des mines de St-Étienne (chair) Sören Auer, Universität Bonn / Fraunhofer IAIS Philippe Beaune, École des mines de St-Étienne Jérôme David, Université Pierre-Mendès France Frédérique Laforest, Université Jean Monnet, Télécom Saint Étienne Christoph Lange, Universität Bonn, Fraunhofer IAIS Pierre Maret, Université Jean Monnet Xavier Serpaggi, École des mines de St-Étienne Thomas Steiner, Université de Lyon / Google Hamburg -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel CS 62362 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: WWW 2012 metadata available + applications for metadata challenge
Just a small correction, there are actually 5 applications participating as I missed one in my list. It's all corrected on the website. Le 15/04/2012 16:10, Antoine Zimmermann a écrit : We have the pleasure to announce that the metadata of the World Wide Web Conference have been released in RDF format on the Semantic Web Dog Food server [1]. It contains information about: - the papers at the main track, the demo track, the developer track, the industry track, the poster track, the European project track; - the authors with their affiliations; - the various committee members with their affiliations; - the presentations for these tracks along with the places, sessions and tracks where they will occur; - the panels, keynotes, moderators, session chairs, - the papers, authors and committee of 13 workshops: AdMIRE2012, CQA2012, EWFE2012, Email2012, LDOW2012, LiLe2012, MSND2012, SWSC2012, TempWeb2012, WI&C2012, WS-REST2012, WebQuality2012, USEWOD2012. In additional to this release, there have been 5 submissions to the metadata challenge [2], 4 of which will be featured for the price (sponsored by Antidot [3]) plus an additional student application. The applications of the challenge, are available for all the conference attendees to try and people will be able to vote for their preferred application. This will be taken into account to determine the winner. We encourage everybody (not only conference attendees) to try these applications, provide feedback to their respective authors and provide feedback to us if you notice any inaccuracies in the datasets. [1] Semantic Web Dog Food. http://data.semanticweb.org/ [2] Metadata Challenge. http://azimmerm.no-ip.org/metadata.html [3] Antidot. http://www.antidot.net/ -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 83 36 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
WWW 2012 metadata available + applications for metadata challenge
We have the pleasure to announce that the metadata of the World Wide Web Conference have been released in RDF format on the Semantic Web Dog Food server [1]. It contains information about: - the papers at the main track, the demo track, the developer track, the industry track, the poster track, the European project track; - the authors with their affiliations; - the various committee members with their affiliations; - the presentations for these tracks along with the places, sessions and tracks where they will occur; - the panels, keynotes, moderators, session chairs, - the papers, authors and committee of 13 workshops: AdMIRE2012, CQA2012, EWFE2012, Email2012, LDOW2012, LiLe2012, MSND2012, SWSC2012, TempWeb2012, WI&C2012, WS-REST2012, WebQuality2012, USEWOD2012. In additional to this release, there have been 5 submissions to the metadata challenge [2], 4 of which will be featured for the price (sponsored by Antidot [3]) plus an additional student application. The applications of the challenge, are available for all the conference attendees to try and people will be able to vote for their preferred application. This will be taken into account to determine the winner. We encourage everybody (not only conference attendees) to try these applications, provide feedback to their respective authors and provide feedback to us if you notice any inaccuracies in the datasets. [1] Semantic Web Dog Food. http://data.semanticweb.org/ [2] Metadata Challenge. http://azimmerm.no-ip.org/metadata.html [3] Antidot. http://www.antidot.net/ -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 83 36 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: CfP - 7th Review of April Fool's day Transactions (RAFT 2012)
Reminder. We will still accept submissions for a few days. Le 20/02/2012 10:36, Antoine Zimmermann a écrit : As RAFT hit the LOD community in 2010 with the seminal paper "Leveraging Non-Lexical Knowledge for the Linked Open Data Web", I invite Linked Data specialists as well as Semantic Web experts to submit to our annual review on nonchalant research. Apologies for multiple postings. Please disseminate widely. More information at http://www.aprilfoolsreview.com/ Call for papers --- We are very proud to announce the seventh edition of the Review of April Fool's day Transactions (RAFT'2012) which unexpectedly follows the sixth edition in 2011. Last year, we had an impressive media coverage, with an astounding reference in The Wall Street Journal. This year, we are planning to award the best paper by engraving the winners' article in stone tablets, to be displayed at a public event. For these reasons, we invite you to submit a paper, by March 15th, 2012, to the RAFT Editorial Board for consideration at the RAFT'2012 'Ground Breaking' edition. According to the Maias, it is your last chance of having a paper published in RAFT before the end of the world. Themes -- In the same spirit as in the previous years' issues, we demand that the submitted papers follow strict rigour, technical soundness, originality, humour, funniness, weirdness and comprehensibleness. We greatly recommend nonsense, Gibberish, gobbledygook jargon and blah blah. Topics are entirely up to the authors, but a rude scientific treatment should be inflicted to the matter in question. Instructions Papers must be submitted via email to either Rodolphe Héliot (r...@aprilfoolsreview.com) or Antoine Zimmermann (a...@aprilfoolsreview.com) and should fit one of the following formats: LaTeX or any kind of formatted text (e.g., Micro$oft Word, RTF, HTML, etc). Paper language can be either French or English. Important dates --- Submission deadline 15th March 2012 Notification of acceptance 20th March 2012 Camera ready papers 24rd March 2012 April Fool's day 1st April 2012 Best regards, -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 83 36 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: owl:sameAs temptation
Le 08/03/2012 16:01, Sarven Capadisli a écrit : Hi Antoine, Thank you for that excellent break down. I have a much better understanding now. Of course, only on the surface :) I didn't know about punning. I've decided to go ahead with the switch from skos:exactMatch to owl:sameAs in my case for two reasons: * My resource can easily be seen as the same thing as the other resource. That is, the descriptions can be merged and it still makes sense, and nothing jumps out at me that suggests otherwise. * OWL DL is too far down for me to fear the complications. I think the benefits here outweigh the possible complications, if any. Fingers crossed. :) Would you mind elaborating on why you think skos:Concept is not necessarily a class? skos:Concept itself is a class, but instances of skos:Concept do not need be classes. This is explicit in the SKOS recommendation, at Section 3.5.1 (http://www.w3.org/TR/2009/REC-skos-reference-20090818/#L896): "Other than the assertion that skos:Concept is an instance of owl:Class, this specification does not make any additional statement about the formal relationship between the class of SKOS concepts and the class of OWL classes. The decision not to make any such statement has been made to allow applications the freedom to explore different design patterns for working with SKOS in combination with OWL." Best, AZ Thanks again! I'm marking your mail for future reference. -Sarven On 12-03-07 03:00 AM, Antoine Zimmermann wrote: If you care about what the OWL spec says and don't want to write something invalid (or inconsistent), you first have to distinguish between OWL DL and OWL Full. In OWL Full, everything is an instance of owl:Thing. Classes, Properties, Literals, Datatypes, etc are instances of owl:Thing. Even owl:Thing itself is an instance of owl:Thing. That is to say that owl:Thing is equivalent to rdfs:Resource. So, owl:sameAs can be used for anything. Which does not mean that it should! In OWL DL, there are restrictions but since OWL 2 is standard, it's been more complicated. owl:Thing does not contain classes. So, in principle, owl:sameAs must not be used to relate an individual to a class. But OWL 2 introduced the idea of "punning" which says that you can use a *class name* as an *individual name*. So, for example, this is legal in OWL 2 DL (Turtle syntax): :c a owl:Class . :x a :c . :x owl:sameAs :c . The fact is that :c on line 2 is a class, while :c on line 3 is an individual. Morever, :c on line 2 and :c on line 3 have absolutely no semantic relationship. They simply have the same name. But again, it's not because it's allowed that it is necessarily good. Now, if you really *need* to say that :a owl:sameAs :b, then by all means do. But remember that this means that :a and :b *is* only one individual. If you don't need to assert this identity, maybe it's better using something like skos:exactMatch. If your application does not treat owl:sameAs in any special way (e.g., you use an OWL reasoner, or you display the owl:sameAs link in a special way) then you really don't need owl:sameAs. If you are doing something special for the owl:sameAs predicate, you have to be conscious of the implications. In any case, there is no problem having a skos:Concept of type owl:Thing in either OWL DL or OWL Full. A skos:Concept is not necessarily a class. AZ Le 07/03/2012 07:43, Sarven Capadisli a écrit : Hi, I'm sure this is talked somewhere, I'd love a pointer if you know any: I often see resources of type owl:Class get paired with resources of type owl:Thing using owl:sameAs. As far as I understand, this is incorrect since domain and range of owl:sameAs should be owl:Thing. I'm tempted to change my resource that is a skos:Concept skos:exactMatch'ed with a resource of type owl:Thing, and use owl:sameAs. Sort of like "everyone else is doing it, it should be okay", and "don't need to fear the thought police". However, I don't wish to do that with a clear conscience, hence, I'd appreciate it if anyone can shed some light here for me and help me understand to make an informed decision based on reason (no pun intended). Related to this, I was wondering whether it makes sense to claim a resource to be of type owl:Class as well as of type owl:Thing, where may be appropriate, or one could get away with it e.g., a country. If this is okay, I imagine it is okay to use owl:sameAs for the subject at hand and point to yet another thing. Thanks all. -Sarven -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 83 36 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: owl:sameAs temptation
If you care about what the OWL spec says and don't want to write something invalid (or inconsistent), you first have to distinguish between OWL DL and OWL Full. In OWL Full, everything is an instance of owl:Thing. Classes, Properties, Literals, Datatypes, etc are instances of owl:Thing. Even owl:Thing itself is an instance of owl:Thing. That is to say that owl:Thing is equivalent to rdfs:Resource. So, owl:sameAs can be used for anything. Which does not mean that it should! In OWL DL, there are restrictions but since OWL 2 is standard, it's been more complicated. owl:Thing does not contain classes. So, in principle, owl:sameAs must not be used to relate an individual to a class. But OWL 2 introduced the idea of "punning" which says that you can use a *class name* as an *individual name*. So, for example, this is legal in OWL 2 DL (Turtle syntax): :c a owl:Class . :x a :c . :x owl:sameAs :c . The fact is that :c on line 2 is a class, while :c on line 3 is an individual. Morever, :c on line 2 and :c on line 3 have absolutely no semantic relationship. They simply have the same name. But again, it's not because it's allowed that it is necessarily good. Now, if you really *need* to say that :a owl:sameAs :b, then by all means do. But remember that this means that :a and :b *is* only one individual. If you don't need to assert this identity, maybe it's better using something like skos:exactMatch. If your application does not treat owl:sameAs in any special way (e.g., you use an OWL reasoner, or you display the owl:sameAs link in a special way) then you really don't need owl:sameAs. If you are doing something special for the owl:sameAs predicate, you have to be conscious of the implications. In any case, there is no problem having a skos:Concept of type owl:Thing in either OWL DL or OWL Full. A skos:Concept is not necessarily a class. AZ Le 07/03/2012 07:43, Sarven Capadisli a écrit : Hi, I'm sure this is talked somewhere, I'd love a pointer if you know any: I often see resources of type owl:Class get paired with resources of type owl:Thing using owl:sameAs. As far as I understand, this is incorrect since domain and range of owl:sameAs should be owl:Thing. I'm tempted to change my resource that is a skos:Concept skos:exactMatch'ed with a resource of type owl:Thing, and use owl:sameAs. Sort of like "everyone else is doing it, it should be okay", and "don't need to fear the thought police". However, I don't wish to do that with a clear conscience, hence, I'd appreciate it if anyone can shed some light here for me and help me understand to make an informed decision based on reason (no pun intended). Related to this, I was wondering whether it makes sense to claim a resource to be of type owl:Class as well as of type owl:Thing, where may be appropriate, or one could get away with it e.g., a country. If this is okay, I imagine it is okay to use owl:sameAs for the subject at hand and point to yet another thing. Thanks all. -Sarven -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 83 36 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
WWW2012 Metadata Challenge: *Extended Deadline* 5 March + additional information
ate, applicants must send by email the following information before 25th February, 2012 to antoine.zimmerm...@emse.fr. The following information must be provided: * Name of the application. * Abstract: no more than 200 words. * URL of a description: a hyperlink pointing to a description of the application that should show details of the system, including which features or functions the system provides. This should be no more than 2 pages when printed, but it can link to other web pages giving technical details. * Web access: the application should be accessible via the Web. If the application is not publicly accessible, passwords should be provided. A (short) set of instructions on how to start and use the application should also be provided on the web page. Moreover, applicants may declare their intent to participate by sending an email to the organisers. This way, they will be notified when the dataset is available and they will get a link to a dump of the dataset. 4. Datasets --- The datasets will be made available after the notification of acceptance. Before they are released, developers can start testing their application on previous conference datasets, such as WWW 2011 or ISWC 2011, available at The Semantic Web Dog Food server. The datasets for WWW 2012 will be available there as well using the same format and vocabularies. Participants who sent an email prior to their submission will be notified when the dataset is available. 5. Winners and prizes - The best application will be chosen by the committee during the conference based on the experience of using the applications in the course of the event. The winners will be rewarded a monetary prize (to be decided). A short listing of "featured applications" will be defined before the conference. 6. Contact -- Antoine Zimmerrmann, EMSE/LSTI Fayol, Université de Lyon, France, antoine.zimmerm...@emse.fr Daniel Schwabe, PUC-Rio, Brazil, dschw...@inf.puc-rio.br 7. Links * This call online. http://www.emse.fr/~zimmermann/metadata.html * Semantic Web Dog Food. http://data.semanticweb.org/ * Second Linked Data-a-thon. http://iswc2011.semanticweb.org/calls/linked-data-a-thon/ * WWW 2010 metadata explorer. http://tw.rpi.edu/www2011/ * ISWC 2010 metadata explorer. http://iswc.mobi/2011/home.html -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66
CfP - 7th Review of April Fool's day Transactions (RAFT 2012)
As RAFT hit the LOD community in 2010 with the seminal paper "Leveraging Non-Lexical Knowledge for the Linked Open Data Web", I invite Linked Data specialists as well as Semantic Web experts to submit to our annual review on nonchalant research. Apologies for multiple postings. Please disseminate widely. More information at http://www.aprilfoolsreview.com/ Call for papers --- We are very proud to announce the seventh edition of the Review of April Fool's day Transactions (RAFT'2012) which unexpectedly follows the sixth edition in 2011. Last year, we had an impressive media coverage, with an astounding reference in The Wall Street Journal. This year, we are planning to award the best paper by engraving the winners' article in stone tablets, to be displayed at a public event. For these reasons, we invite you to submit a paper, by March 15th, 2012, to the RAFT Editorial Board for consideration at the RAFT'2012 'Ground Breaking' edition. According to the Maias, it is your last chance of having a paper published in RAFT before the end of the world. Themes -- In the same spirit as in the previous years' issues, we demand that the submitted papers follow strict rigour, technical soundness, originality, humour, funniness, weirdness and comprehensibleness. We greatly recommend nonsense, Gibberish, gobbledygook jargon and blah blah. Topics are entirely up to the authors, but a rude scientific treatment should be inflicted to the matter in question. Instructions Papers must be submitted via email to either Rodolphe Héliot (r...@aprilfoolsreview.com) or Antoine Zimmermann (a...@aprilfoolsreview.com) and should fit one of the following formats: LaTeX or any kind of formatted text (e.g., Micro$oft Word, RTF, HTML, etc). Paper language can be either French or English. Important dates --- Submission deadline 15th March 2012 Notification of acceptance 20th March 2012 Camera ready papers 24rd March 2012 April Fool's day 1st April 2012 Best regards, -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 83 36 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: Modelling colors
As far as I remember when it was announced, Linked Open Colors was not really a joke. It was clearly something made for fun, but it was also trying to usefully model colors according to Linked Data principles. Le 26/01/2012 00:15, Melvin Carvalho a écrit : I see hasColor a lot in the OWL documentation but I was trying to work out a way to say something has a certain color. I understand linked open colors was a joke Anyone know of an ontology with color or hasColor as a predicate?
Second Call for applications: WWW2012 Metadata Challenge
ting their application on previous conference datasets, such as WWW 2011 or ISWC 2011, available at The Semantic Web Dog Food server. The datasets for WWW 2012 will be available there as well using the same format and vocabularies. Participants who sent an email prior to their submission will be notified when the dataset is available. 5. Winners and prizes - The best application will be chosen by the committee during the conference based on the experience of using the applications in the course of the event. The winners will be rewarded a monetary prize (to be decided). A short listing of "featured applications" will be defined before the conference. 6. Contact -- Antoine Zimmerrmann, EMSE/LSTI Fayol, Université de Lyon, France, antoine.zimmerm...@emse.fr Daniel Schwabe, PUC-Rio, Brazil, dschw...@inf.puc-rio.br 7. Links * This call online. http://www.emse.fr/~zimmermann/metadata.html * Semantic Web Dog Food. http://data.semanticweb.org/ * Second Linked Data-a-thon. http://iswc2011.semanticweb.org/calls/linked-data-a-thon/ * WWW 2010 metadata explorer. http://tw.rpi.edu/www2011/ * ISWC 2010 metadata explorer. http://iswc.mobi/2011/home.html -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Call for applications: WWW2012 Metadata Challenge
ting their application on previous conference datasets, such as WWW 2011 or ISWC 2011, available at The Semantic Web Dog Food server. The datasets for WWW 2012 will be available there as well using the same format and vocabularies. Participants who sent an email prior to their submission will be notified when the dataset is available. 5. Winners and prizes - The best application will be chosen by the committee during the conference based on the experience of using the applications in the course of the event. The winners will be rewarded a monetary prize (to be decided). A short listing of "featured applications" will be defined before the conference. 6. Contact -- Antoine Zimmerrmann, EMSE/LSTI Fayol, Université de Lyon, France, antoine.zimmerm...@emse.fr Daniel Schwabe, PUC-Rio, Brazil, dschw...@inf.puc-rio.br 7. Links * This call online. http://www.emse.fr/~zimmermann/metadata.html * Semantic Web Dog Food. http://data.semanticweb.org/ * Second Linked Data-a-thon. http://iswc2011.semanticweb.org/calls/linked-data-a-thon/ * WWW 2010 metadata explorer. http://tw.rpi.edu/www2011/ * ISWC 2010 metadata explorer. http://iswc.mobi/2011/home.html -- Antoine Zimmermann ISCOD / LSTI - Institut Henri Fayol École Nationale Supérieure des Mines de Saint-Étienne 158 cours Fauriel 42023 Saint-Étienne Cedex 2 France Tél:+33(0)4 77 42 66 03 Fax:+33(0)4 77 42 66 66 http://zimmer.aprilfoolsreview.com/
Re: Advocacy URL for publishing data with an explicit license
Chris and Tom's book [1] has a section [2] on this. Of course, it's for RDF specifically. [1] Tom Heath, Christian Bizer. Linked Data: Evolving the Web into a Global Data Space. http://linkeddatabook.com/ [2] 4.3.3 Licenses, Waivers and Norms for Data. In [1]. http://linkeddatabook.com/editions/1.0/#htoc48 Le 24/10/2011 20:28, Richard Cyganiak a écrit : Dear list, We all know that data publishers *should* publish their data along with an explicit license that explains what kind of re-use is allowed. Can anyone suggest a good reference/link/URL that makes this case? A blog post or advocacy site or similar? Bonus points if it has specific recommendations for RDF. My preferred candidate so far is this – but it's not particularly strong on the “why”: http://www.w3.org/TR/void/#license Thanks, Richard
Re: Think before you write Semantic Web crawlers
Richard, My concern is not really about the idea of blacklisting etc. I am concerned about the means. Certainly a public wikipage is not a good place to put accusations. Le 23/06/2011 11:01, Richard Cyganiak a écrit : Antoine, On 23 Jun 2011, at 07:27, Antoine Zimmermann wrote: I started a list here: http://www.w3.org/wiki/Bad_Crawlers What's the use of this list? Assume it stays empty, as you hope. What's the use? That should be obvious. Not to me. Can you elaborate? Assume it gets filled with names: so what? It does not prove these crawlers are bad. The authors of the crawlers can just remove themselves from the list. Check out the "watch" and "history" tabs on that page. And? so on Thursday 23rd, 9:04, user foobar96 wrote that Sindice is a bad crawler. Then what? If a crawler is on the list, chances are that nobody would notice anyway, especially not the kind of people that Martin is defending in his email. It takes very little effort to make a copy-paste Apache config snippet that blocks the offending IP ranges. Pointing the victims of abusive crawlers to such a snippet is a first-aid measure. How do you know who are the victims? They somehow have to make themselves known so that they can be directed to the wiki page. If you know the victims, you'd better give them the config snippet directly. A wiki page which is /accusing/ people is much more likely to be inaccurate (or empty) than a wiki page with encyclopedic details on common knowledge. If a crawler is put to the list because it is bad and measures are taken, what happens when the crawler get fixed and become polite? And what if measures are taken while the crawler was not bad at all to start with? It shifts some pain from the server operators to the crawler operators who have to see how they get off the list again. That's a good thing. It's a public wiki. It can hardly be simpler to get off the list. Surely, this list is utterly useless. It's important to show that the community is taking the issue serious and is establishing social norms and processes to deal with problems as they arise. These processes will start out primitive, but I'd claim that a wiki page is one step up in sophistication from this mailing list thread. I hear you, but not like that, not with a public wiki page. Best AZ Best, Richard Maybe you can keep the page to describe what are the problems that bad crawlers create and what are the measures that publishers can take to overcome problematic situation. AZ The list is currently empty. I hope it stays that way. Thank you all, Richard -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Tel: +33(0)4 72 43 61 74 - Fax: +33(0)4 72 43 87 13 Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Think before you write Semantic Web crawlers
Just one more comment: such a list could be useful if it's published by a well identified person or group who can be contacted in case of disagreement or to get off the list. Le 23/06/2011 08:27, Antoine Zimmermann a écrit : Le 22/06/2011 23:49, Richard Cyganiak a écrit : On 21 Jun 2011, at 10:44, Martin Hepp wrote: PS: I will not release the IP ranges from which the trouble originated, but rest assured, there were top research institutions among them. The right answer is: name and shame. That is the way to teach them. Like Karl said, we should collect information about abusive crawlers so that site operators can defend themselves. It won't be *that* hard to research and collect the IP ranges of offending universities. I started a list here: http://www.w3.org/wiki/Bad_Crawlers What's the use of this list? Assume it stays empty, as you hope. What's the use? Assume it gets filled with names: so what? It does not prove these crawlers are bad. The authors of the crawlers can just remove themselves from the list. If a crawler is on the list, chances are that nobody would notice anyway, especially not the kind of people that Martin is defending in his email. If a crawler is put to the list because it is bad and measures are taken, what happens when the crawler get fixed and become polite? And what if measures are taken while the crawler was not bad at all to start with? Surely, this list is utterly useless. Maybe you can keep the page to describe what are the problems that bad crawlers create and what are the measures that publishers can take to overcome problematic situation. AZ The list is currently empty. I hope it stays that way. Thank you all, Richard
Re: Think before you write Semantic Web crawlers
Le 22/06/2011 23:49, Richard Cyganiak a écrit : On 21 Jun 2011, at 10:44, Martin Hepp wrote: PS: I will not release the IP ranges from which the trouble originated, but rest assured, there were top research institutions among them. The right answer is: name and shame. That is the way to teach them. Like Karl said, we should collect information about abusive crawlers so that site operators can defend themselves. It won't be *that* hard to research and collect the IP ranges of offending universities. I started a list here: http://www.w3.org/wiki/Bad_Crawlers What's the use of this list? Assume it stays empty, as you hope. What's the use? Assume it gets filled with names: so what? It does not prove these crawlers are bad. The authors of the crawlers can just remove themselves from the list. If a crawler is on the list, chances are that nobody would notice anyway, especially not the kind of people that Martin is defending in his email. If a crawler is put to the list because it is bad and measures are taken, what happens when the crawler get fixed and become polite? And what if measures are taken while the crawler was not bad at all to start with? Surely, this list is utterly useless. Maybe you can keep the page to describe what are the problems that bad crawlers create and what are the measures that publishers can take to overcome problematic situation. AZ The list is currently empty. I hope it stays that way. Thank you all, Richard
Re: Schema.org in RDF ...
Le 07/06/2011 10:22, Michael Hausenblas a écrit : Something I don't understand. If I read well all savvy discussions so far, publishers behind http://schema.org URIs are unlikely to ever provide any RDF description, What makes you so sure about that not one day in the (near?) future the Schema.org URIs will serve RDF or JSON, FWIW, additionally to HTML? ;) Sure and I'm tempted to believe that this will happen eventually. Nonetheless, Bernard makes a good point: the URIs, such as http://schema.org/Thing, are information resources, as far as httpRange14 is concerned. If you guys from the Linked Data Research Centre are not following httpRange14 resolution, who will? Anyway, schema.rdfs.org is very good initiative and an excellent answer to schema.org. AZ. Cheers, Michael -- Dr. Michael Hausenblas, Research Fellow LiDRC - Linked Data Research Centre DERI - Digital Enterprise Research Institute NUIG - National University of Ireland, Galway Ireland, Europe Tel. +353 91 495730 http://linkeddata.deri.ie/ http://sw-app.org/about.html On 7 Jun 2011, at 08:44, Bernard Vatant wrote: Hi all Something I don't understand. If I read well all savvy discussions so far, publishers behind http://schema.org URIs are unlikely to ever provide any RDF description, so why are those URIs declared as identifiers of RDFS classes in the http://schema.rdfs.org/all.rdf. For all I can see, http://schema.org/Person is the URI of an information resource, not of a class. So I would rather have expected mirroring of the schema.org URIs by schema.rdfs.org URIs, the later fully dereferencable proper RDFS classes expliciting the semantics of the former, while keeping the reference to the source in some dcterms:source element. Example, instead of ... http://schema.org/Person";> http://www.w3.org/2000/01/rdf-schema#Class"/> Person A person (alive, dead, undead, or fictional). http://schema.org/Thing"/> http://schema.org/Person"/> where I see a clear abuse of rdfs:isDefinedBy, since if you dereference the said URI, you don't find any explicit RDF definition ... I would rather have the following http://schema.rdfs.org/Person";> http://www.w3.org/2000/01/rdf-schema#Class"/> Person A person (alive, dead, undead, or fictional). http://schema.rdfs.org/Thing"/> http://schema.org/Person"/> To the latter declaration, one could safely add statements like schema.rdfs:Person rdfs:subClassOf foaf:Person etc Or do I miss the point? Bernard 2011/6/3 Michael Hausenblas http://schema.rdfs.org ... is now available - we're sorry for the delay ;) Cheers, Michael -- Dr. Michael Hausenblas, Research Fellow LiDRC - Linked Data Research Centre DERI - Digital Enterprise Research Institute NUIG - National University of Ireland, Galway Ireland, Europe Tel. +353 91 495730 http://linkeddata.deri.ie/ http://sw-app.org/about.html -- Bernard Vatant Senior Consultant Vocabulary & Data Integration Tel: +33 (0) 971 488 459 Mail: bernard.vat...@mondeca.com Mondeca 3, cité Nollez 75018 Paris France Web: http://www.mondeca.com Blog: http://mondeca.wordpress.com -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Tel: +33(0)4 72 43 61 74 - Fax: +33(0)4 72 43 87 13 Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Common RDF Vocabulary Labels Vocabulary
May I suggest that you add language tags, and possibly later extend this vocab with other languages? I can even provide the terms in French. Le 06/06/2011 00:36, David Wood a écrit : Hi all, I would like to announce the availability of a small, but hopefully useful, vocabulary consisting of singular, plural and inverse singular human-readable labels for some common RDF vocabularies. The idea is to provide a way for user interfaces to look up labels for RDF classes and properties where they were not provided by their vocabulary's author. The Common RDF Vocabulary Labels Vocabulary is available via content negotiation at: http://purl.org/net/prototypo/labels The HTML description needs some work, but I need to play with my kids now. The Turtle is probably the easiest version to look at for the moment: http://purl.org/net/prototypo/labels-20110603.ttl Have fun and please tell me if I should add any other labels. Regards, Dave -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Tel: +33(0)4 72 43 61 74 - Fax: +33(0)4 72 43 87 13 Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Labels separate from localnames (Was: Best Practice for Renaming OWL Vocabulary Elements
hMonkey will never see the vocabulary labels, only the person configuring the generation of data. Google Rich Snippets don't show the labels because it is specifically tuned for GoodRelations. But a generic tool which aggregates information from various sources using various vocabularies has to make a generic assumption on what to display. rdfs:label is what is often chosen by generic tools to be shown to people. +1 2) Never put explanations for ontology engineers in the label. In the comment, OK, not the label. NOT rdfs:label "NewPropertyName1 (Note: See old URI foo:LongPropertyName1 used previously)" . but more like rdfs:label "new form label1"; rdfs:comment " (Note: See old URI foo:LongPropertyName1 used previously)" . You don't want that stuff showing up for users, in reports, forms, etc. As for the reference to the new element etc., I agree with you; that was just to keep the proposal short and simple. We will usually have a note "(DEPRECATED)" as part of the label, but no further explanation. It is pretty simple for and end-user tool to filter out the three patterns of developer information from GoodRelations labels by simple regex. > Again, the majority of the people dealing with rdfs:labels from vocabularies will be developers, not end-users, because you will need an intermediate layer between the data and the user anyway. Again, this only works if you fine tune your application towards GoodRelations. One of the strength of RDF is that it is easy to aggregate data relying on many vocabularies that the consuming application doesn't even know about. Having general guidelines for rdfs:label such that it can be applied to any vocabulary is very good, IMO. By ignoring these guidelines, you make GoodRelations a kind of proprietary format which only works fine with GoodRelations-specific applications. Regards, AZ. +1 Martin: In addition, if you are evolving the ontology (which I believe is the case) and seek to keep backward compatibility i.e., keeping classes and properties functional across ontology releases, just use owl:equivalentClass and owl:equivalentProperty accordingly. Naturally, if this evolution includes new levels abstraction then rdfs:subClassOf and rdfs:subPopertyOf should be put to use etc.. Yes, that was in my original proposal. We can't really negate reasoning, especially when showcases emerge that help general appreciation of OWL which (IMHO) continues to get an unjustified bad rap. Yes, I agree. I also think that since the little bit of reasoning needed in here can be easily implemented in SPARQL CONSTRUCT rules or SPIN, it is much better to take conceptually superior OWL axioms than "quick and dirty sameAs", which will backfire in the long run. Again, thanks for your detailed feedback! Martin [...] -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Tel: +33(0)4 72 43 61 74 - Fax: +33(0)4 72 43 87 13 Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
6th Review of April Fool's day Transactions (RAFT2011) online
Dear all, Last year, we published the Linked Open Numbers paper [1] which was a big success in the Linked Data community. This year, we do not have a Linked Data or SemWeb related article but have an even bigger result in our annual journal [2]. Moreover, the Wall Street Journal announced the issue in advance [3]. We are very proud to tell you that the 6th Review of April Fool's day Transactions (RAFT 2011) [4] is now online! RAFT website: http://www.aprilfoolsreview.com/ Follow us on Twitter: http://twitter.com/aprilfoolreview Rodolphe Héliot and Antoine Zimmermann RAFT editors. [1] Denny Vrandečíc, Markus Krötzsch, Sebastian Rudolph and Uta Lösche. Leveraging Non-Lexical Knowledge for the Linked Open Data Web. In 5th Review of April Fool's Transactions (RAFT 2010), pages 18-27, 2010. [2] Pascal Hitzler. A Proof that P != NP. In 6th Review of April Fool's Transactions (RAFT 2011), pages 7-8, 2011. [3] Ideas Calendar: March 26-April 1. In The Wall Street Journal. March 26th, 2011. http://online.wsj.com/article/SB10001424052748703858404576214621397584808.html [4] Rodolphe Héliot and Antoine Zimmermann (eds.). The 6th Review of April Fool's day Transactions, RAFT 2011. http://zimmer.aprilfoolsreview.com/RAFT/RAFTpapers/RAFT2011.pdf
Re: data schema / vocabulary / ontology / repositories
Keith, Could you please add a few words about SchemaCache on this wiki page: http://www.w3.org/wiki/Ontology_Dowsing#Repositories Thanks and regards, AZ. Le 14/03/2011 14:18, Keith Alexander a écrit : On Mon, Mar 14, 2011 at 8:28 AM, Martin Hepp wrote: Hi Dieter: There are several ontology repositories available on-line, but to my knowledge they all suffer from two serious limitations: 1. They do not rate ontologies by quality/relevance/popularity, so you do not get any hint whether foaf:Organization or foo:Organization will be the best way to expose your data. Schemacache[1] used to order results by the number of documents Sindice found it it, but this wasn't terribly effective; what we want is something more like "number of individual publishers using term X" rather than "number of individual documents using term X". I could work this out without too much difficulty from the VoID descriptions published by CKAN[2] if more dataset descriptions listed void:exampleResources (around half of them don't), and if more VoID dataset descriptions specified the dct:publisher and dct:creator of the dataset, this would also be useful. 2. The selection of ontologies listed is, to say the best, often biased or partly a random choice. I do not know any repository that - has a broad coverage, - includes the top 25 linked data ontologies and - lists more non-toy ontologies than abandoned PhD project prototypes. The most useful tool for your purpose is likely http://prefix.cc/popular/all Schemacache used to be rather polluted with abandoned and toy ontologies, but in November last year I started afresh with only the namespaces registered on http://prefix.cc The search results are now much more likely to be useful, though there is still the odd bit of junk in there, and there is certainly room for improvement. [1] http://schemacache.com [2] http://semantic.ckan.net/sparql -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Call for Papers: 6th Review of April Fool's day Transactions (RAFT 2011)
Dear all, With our Review of April Fool's day Transactions, we are leveraging nonchalant knowledge for the LOD web! Please look at the "they are citing us" section to see how this call is related to public-lod. Apologies for multiple postings. Please disseminate widely. More information at http://www.aprilfoolsreview.com/ Follow us on Twitter: http://twitter.com/aprilfoolreview - Call for papers Thanks to an incredibly successful 2010 issue, we are very proud to announce the sixth edition of the Review of April Fool's day Transactions (RAFT'2011). Not only RAFT is now widely recognised by our community, it is today expanding its sphere of influence beyond its traditionnal borders, to reach new--and exciting!--areas of science. For this reason, we invite you to submit a paper, by March 10th, 2011, to the RAFT Program Committee for consideration at the RAFT'2011 'Beyond Frontiers' edition. The tremendous investment we've been pouring into RAFT for years has paid off, and with your support, we plan to bring our publishing standards even further this year. Themes In the same spirit as in the previous years' issues, we demand that the submitted papers follow strict rigour, technical soundness, originality, humour, funniness, weirdness and comprehensibleness. We greatly recommend nonsense, Gibberish, gobbledygook jargon and blah blah. Topics are entirely up to the authors, but a rude scientific treatment should be inflicted to the matter in question. Instructions Papers must be submitted via email to either Rodolphe Héliot (r...@aprilfoolsreview.com) or Antoine Zimmermann (a...@aprilfoolsreview.com) and should fit one of the following formats: LATEX or any kind of formatted text (e.g., Micro$oft Word, RTF, HTML, etc). Paper language can be either French or English. Important dates Submission deadline 10th March 2011 Notification of acceptance 17th March 2011 Camera ready papers 23rd March 2011 April Fool's day 1st April 2011 They are citing us! The following papers from RAFT have been cited: Denny Vrandecíc, Markus Krötzsch, Sebastian Rudolph and Uta Lösche. Leveraging Non-Lexical Knowledge for the Linked Open Data Web. In 5th Review of April Fool's Transactions (RAFT 2010), pages 18-27, 2010. Cited by: Pascal Hitzler and Frank van Harmelen. A Reasonable Semantic Web. In the Semantic Web Journal, Vol. 1, issue 1-2, pages 39-44. IOS Press. Cited by: Christoph Lange. Christoph Lange. Towards OpenMath Content Dictionaries as Linked Data. In Michael Kohlhase, Christoph Lange, eds.: 23rd OpenMath Workshop, July 2010. Cited by: Christoph Lange. Integrating Mathematics into the Web of Data. In Sören Auer, Stefan Decker, Manfred Hauswirth, eds.: Linked Data in the Future Internet, Future Internet Assembly, 2010-12-16/2010-12-17 in Ghent, Belgium, 2010. Cited by: Christoph Lange. Integrated Semantic Web Collaboration on Semiformal Mathematical Knowledge. Ph.D. thesis. Jacobs University Bremen. 2010. Antoine Zimmermann. A study of LOLs on the web. In 2nd Review of April Fool's Transactions (RAFT 2007), pages 12-16, 2007. Cited by: Sam Jodhunt, Bernie Sormithy and Ewan Thenjabor. A study of the seldomness of strong human emotions using internet metrology. In 5th Review of April Fool's Transactions (RAFT 2010), pages 8-17, 2010. Christine Azevedo-Coste. Towards an FES-assisted smile. In 3rd Review of April Fool's Transactions (RAFT 2008), pages 16-17, 2008. Cited by: Antoine Zimmermann. AckGenTM: The Acknowledgement Generator - A Case Study. In 3rd Review of April Fool's Transactions (RAFT 2008), pages 42-47, 2008. Staff The committee of the RAFT is composed of two half-human/half-scientist individuals who have been bred by a pack of crazy erudites. Editors Rodolphe Héliot (r...@aprilfoolsreview.com) Antoine Zimmermann (a...@aprilfoolsreview.com Webmaster Antoine Zimmermann (a...@aprilfoolsreview.com) -- Rodolphe Héliot and Antoine Zimmermann RAFT editors.
Re: AW: ANN: DBpedia 3.6 released
Haha, I went to that page but immediately skipped the header and went downward to the datasets links... Thanks a lot. Regards, AZ. Le 19/01/2011 16:58, Chris Bizer a écrit : Hi Antoine, I was wondering: do you keep older versions of the DBpedia datasets? we do and they are all reachable from the DBpedia download page at http://wiki.dbpedia.org/Downloads36 Just click on the "Older Versions" links. Cheers, Chris -Ursprüngliche Nachricht- Von: public-lod-requ...@w3.org [mailto:public-lod-requ...@w3.org] Im Auftrag von Antoine Zimmermann Gesendet: Mittwoch, 19. Januar 2011 16:49 An: Chris Bizer Cc: dbpedia-announceme...@lists.sourceforge.net; dbpedia- discuss...@lists.sourceforge.net; 'Semantic Web'; 'public-lod' Betreff: Re: ANN: DBpedia 3.6 released Dear Chris and the DBpedia crew, As always, a new version of DBpedia is very good news for the Semantic Web and Linked Data. I was wondering: do you keep older versions of the DBpedia datasets? If yes, would you allow people to download older versions for research purposes? This would be very useful in order to study the dynamics of RDF data, or the dynamics of DBpedia itself. There are already papers on the dynamics of Wikipedia but I am not aware of corresponding work for DBPedia. Regards, AZ. Le 17/01/2011 14:10, Chris Bizer a écrit : > Hi all, > > we are happy to announce the release of DBpedia 3.6. The new release is > based on Wikipedia dumps dating from October/November 2010. > > The new DBpedia dataset describes more than 3.5 million things, of which > 1.67 million are classified in a consistent ontology, including 364,000 > persons, 462,000 places, 99,000 music albums, 54,000 films, 16,500 video > games, 148,000 organizations, 148,000 species and 5,200 diseases. > > The DBpedia dataset features labels and abstracts for 3.5 million things in > up to 97 different languages; 1,850,000 links to images and 5,900,000 links > to external web pages; 6,500,000 external links into other RDF datasets, and > 632,000 Wikipedia categories. > > The dataset consists of 672 million pieces of information (RDF triples) out > of which 286 million were extracted from the English edition of Wikipedia > and 386 million were extracted from other language editions and links to > external datasets. > > Along with the release of the new datasets, we are happy to announce the > initial release of the DBpedia MappingTool > (http://mappings.dbpedia.org/index.php/MappingTool): a graphical user > interface to support the community in creating and editing mappings as well > as the ontology. > > The new release provides the following improvements and changes compared to > the DBpedia 3.5.1 release: > > 1. Improved DBpedia Ontology as well as improved Infobox mappings using > http://mappings.dbpedia.org/. > > Furthermore, there are now also mappings in languages other than English. > These improvements are largely due to collective work by the community. > There are 13.8 million RDF statements based on mappings (11.1 million in > version 3.5.1). All this data is in the /ontology/ namespace. Note that this > data is of much higher quality than the Raw Infobox data in the /property/ > namespace. > > Statistics of the mappings wiki on the date of release 3.6: > > + Mappings: >+ English: 315 Infobox mappings (covers 1124 templates including > redirects) >+ Greek: 137 Infobox mappings (covers 192 templates including > redirects) >+ Hungarian: 111 Infobox mappings (covers 151 templates including > redirects) >+ Croatian: 36 Infobox mappings (covers 67 templates including > redirects) >+ German: 9 Infobox mappings >+ Slovenian: 4 Infobox mappings > + Ontology: >+ 272 classes > + Properties: >+ 629 object properties >+ 706 datatype properties (they are all in the /datatype/ namespace) > > 2. Some commonly used property names changed. > > + Please see http://dbpedia.org/ChangeLog and > http://dbpedia.org/Datasets/Properties to know which relations changed and > update your applications accordingly! > > 3. New Datatypes for increased quality in mapping-based properties > > + xsd:positiveInteger, xsd:nonNegativeInteger, xsd:nonPositiveInteger, > xsd:negativeInteger > > 4. Improved parsing coverage. > > + Parsing of lists of elements in Infobox property values that improves the > completeness of extracted facts. > + Method to deal with missing repeated links in Infoboxes that do appear > somewhere else on the page. > +
Re: ANN: DBpedia 3.6 released
see > http://dbpedia.org/URIencoding for an explanation regarding the DBpedia URI > encoding scheme. > > 8. Extended Datasets: > > + Thanks to Johannes Hoffart (Max-Planck-Institut für Informatik) for > contributing links to YAGO2. > + Freebase links have been updated. They now refer to mids > (http://wiki.freebase.com/wiki/Machine_ID) because guids have been > deprecated. > > You can download the new DBpedia dataset from http://dbpedia.org/Downloads36 > > As usual, the dataset is also available as Linked Data and via the DBpedia > SPARQL endpoint at http://dbpedia.org/sparql > > Lots of thanks to: > > + All editors that contributed to the DBpedia ontology mappings via the > Mappings Wiki. > + Max Jakob (Freie Universität Berlin, Germany) for improving the DBpedia > extraction framework and for extracting the new datasets. > + Robert Isele and Anja Jentzsch (both Freie Universität Berlin, Germany) > for helping Max with their expertise on the extraction framework. > + Paul Kreis (Freie Universität Berlin, Germany) for analyzing the DBpedia > data of the previous release and suggesting ways to increase quality and > quantity. Some results of his work were implemented in this release. > + Dimitris Kontokostas (Aristotle University of Thessaloniki, Greece), Jimmy > O'Regan (Eolaistriu Technologies, Ireland), José Paulo Leal (University of > Porto, Portugal) for providing patches to improve the extraction framework. > + Jens Lehmann and Sören Auer (both Universität Leipzig, Germany) for > providing the new dataset via the DBpedia download server at Universität > Leipzig. > + Kingsley Idehen and Mitko Iliev (both OpenLink Software) for loading the > dataset into the Virtuoso instance that serves the Linked Data view and > SPARQL endpoint. OpenLink Software (http://www.openlinksw.com/) altogether > for providing the server infrastructure for DBpedia. > > The work on the new release was financially supported by: > > + Neofonie GmbH, a Berlin-based company offering leading technologies in the > area of Web search, social media and mobile applications > (http://www.neofonie.de/). > + The European Commission through the project LOD2 - Creating Knowledge out > of Linked Data (http://lod2.eu/). > + Vulcan Inc. as part of its Project Halo (http://www.projecthalo.com/). > Vulcan Inc. creates and advances a variety of world-class endeavors and high > impact initiatives that change and improve the way we live, learn, do > business (http://www.vulcan.com/). > > More information about DBpedia is found at http://dbpedia.org/About > > Have fun with the new dataset! > > The whole DBpedia team also congratulates Wikipedia to its 10th Birthday > which was this weekend! > > Cheers, > > Chris Bizer > > > -- > Prof. Dr. Christian Bizer > Web-based Systems Group > Freie Universität Berlin > +49 30 838 55509 > http://www.bizer.de > ch...@bizer.de > > > -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Linked Open Data star badges
Michael, Good job, I like the look of these badges. However, I'm wondering: will the people who have a 0 or 1-star dataset put a badge on their Web page? It's like putting a badge saying "HTML page /almost/ valid: 3 errors only!" In the end, I guess only the 5 star badge will be proudly displayed by dataset owners. Still, I think those badges have a utility, but not for the dataset owners. I can imagine a web page listing existing, independent datasets (such as [1]) where each row has the corresponding badge. This way, one can immediately and visually determine the level of interoperability of the dataset. [1] http://esw.w3.org/DataSetRDFDumps Cheers, AZ. Le 07/12/2010 11:09, Michael Hausenblas a écrit : If you want to express your support for LOD data on your dataset Web page, you can now use the LOD badges [1] to do so. The LOD badges are based on TimBL's 5-star data scheme, which has been made available via [2]. Cheers, Michael [1] http://lab.linkeddata.deri.ie/2010/lod-badges/ [2] http://www.w3.org/DesignIssues/LinkedData.html -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: 200 OK with Content-Location might work: But maybe it can be simpler?
I'm wondering about the implications of the httpRange-14 decision. In summary, it says: a) if it's 2xx, then it's an information resource; b) if it's 303, then it's whatever; c) if it's 4xx, then it's whatever. First, I'm wondering what is the difference between b) and c). Second, I'm wondering what it implies for other codes, such as 3xx and 5xx. And what about URIs that do not resolve (like hash-URIs)? It seems to me that the absence of specification for these codes means that the URIs may mean whatever. So, is it correct to interpret httpRange-14 as follows: a) if a GET request returns 2xx on a URI then the URI denotes an information resource; b) a URI can be any kind of resource otherwise. Regards, -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: 200 OK with Content-Location might work: But maybe it can be simpler?
Le 05/11/2010 18:25, Giovanni Tummarello a écrit : How about something that's totally independant from HEADER issues? think normal people here. absolutely 0 interest to mess with headers and http responses.. absolutely no business incentive to do it. Solutions to technical problems are not for little kids, grandmothers and casual Web users. Getting a Web page on the Web is actually really complex, you have to do a lot of stuff with the header, maybe content-negociate etc. Yet, little kids and grandmothers can jump from webpages to webpages. as a baseline think someone wanting to annotate with RDFa a hand crafted, apached served html file. really.. as simple as serving this people. Yep, implement the HTTP header stuff in the RDFa editor and it becomes as simple as web browsing 101. as simple as anyone who's using opengraph just copy pastes into their HTML template.. as simple as this really, please, its the only thing that can work? The complexity of a technical solution has really nothing to do with the difficulty of using the solution. Don't worry Gio, this technicality (if it's ever implemented) won't make Sindice and Sig.ma less user-friendly ;) Giovanni Cheers, AZ. On Fri, Nov 5, 2010 at 5:55 PM, Nathan wrote: Mike Kelly wrote: http://tools.ietf.org/html/draft-ietf-httpbis-p2-semantics-12#page-14 snipped and fuller version inserted: 4. If the response has a Content-Location header field, and that URI is not the same as the effective request URI, then the response asserts that its payload is a representation of the resource identified by the Content-Location URI. However, such an assertion cannot be trusted unless it can be verified by other means (not defined by HTTP). If a client wants to make a statement about the specific document then a response that includes a content-location is giving you the information necessary to do that correctly. It's complemented and further clarified in the entity body itself through something like isDescribedBy. I stand corrected, think there's something in this, and it could maybe possibly provide the semantic indirection needed when Content-Location is there, and different to the effective request uri, and complimented by some statements (perhaps RDF in the body, or Link header, or html link element) to assert the same. Covers a few use-cases, might have legs (once HTTP-bis is a standard?). Nicely caught Mike! Best, Nathan -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Is 303 really necessary - demo
Le 05/11/2010 18:01, Nathan a écrit : Antoine Zimmermann wrote: Le 05/11/2010 16:42, Nathan a écrit : [skip] Sadly your proposed 210 still has it, the true problem isn't a status code thing, it's an "if I can GET it, it's a document", hence the earlier outlined problems with 303 as it stands, still the same problem. So, you are against hash URIs? Because if you can GET a hashless URI with 200 OK, then put a hash behind it and you can GET the resulting URI with a 200 OK too. According to httpRange-14, if the HTTP response code for a given URI is 2xx, then the URI denotes an information resource. Quote: """ a) If an "http" resource responds to a GET request with a 2xx response, then the resource identified by that URI is an information resource; """ GET http://liris.cnrs.fr/~azimmerm/antoine -> 200 OK -> it's a document! GET http://liris.cnrs.fr/~azimmerm/antoine#me -> 200 OK -> it's a document! GET http://liris.cnrs.fr/~azimmerm/antoine.rdf -> 200 OK -> it's a document! So your argument is moot since it is going against your own recommendation. Did you check the HTTP request? #frag isn't included, it's chopped off before sending, those three requests resulted in the following 3 URIs being requested: http://liris.cnrs.fr/~azimmerm/antoine http://liris.cnrs.fr/~azimmerm/antoine http://liris.cnrs.fr/~azimmerm/antoine.rdf no frags, un-mooted. Ah yes, forgot this small detail :p. So obviously, a hash URI cannot resolve to 2xx since it cannot resolve at all! But, in the end, isn't it quite the same principle: I use a distinct URI that eventually resolves to the same document? Best, Nathan -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Is 303 really necessary - demo
Le 05/11/2010 14:57, Giovanni Tummarello a écrit : I might be wrong but I dont like it much . Sindice would index it as 2 documents. http://iandavis.com/2010/303/toucan http://iandavis.com/2010/303/toucan.rdf i *really* would NOT want to different URLs resolving to the same thing Hmm, why not? This happens all the time: usually, all terms from a single ontology resolve to the same document. Other examples: http://g1o.net/ http://g1o.net/index.html resolve to the same thing, http://rdfs.org/sioc/ns http://rdfs.org/sioc/ns.rdf resolve to the same thing, etc. etc. etc. I think Sindice is doing well with this, not a problem IMO. /toucan.rdf should be cached once /toucan is visited first (since the HTTP header says /toucan is actually represented in /toucan.rdf). Cheers, AZ. thanks Giovanni On Fri, Nov 5, 2010 at 10:43 AM, Ian Davis wrote: Hi all, To aid discussion I create a small demo of the idea put forth in my blog post http://iand.posterous.com/is-303-really-necessary Here is the URI of a toucan: http://iandavis.com/2010/303/toucan Here is the URI of a description of that toucan: http://iandavis.com/2010/303/toucan.rdf As you can see both these resources have distinct URIs. I created a new property http://vocab.org/desc/schema/description to link the toucan to its description. The schema for that property is here: http://vocab.org/desc/schema (BTW I looked at the powder describedBy property and it's clearly designed to point to one particular type of description, not a general RDF one. I also looked at http://ontologydesignpatterns.org/ont/web/irw.owl and didn't see anything suitable) Here is the URI Burner view of the toucan resource and of its description document: http://linkeddata.uriburner.com/about/html/http://iandavis.com/2010/303/toucan http://linkeddata.uriburner.com/about/html/http/iandavis.com/2010/303/toucan.rdf I'd like to use this demo to focus on the main thrust of my question: does this break the web and if so, how? Cheers, Ian P.S. I am not fully caught up on the other thread, so maybe someone has already produced this demo -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Is 303 really necessary - demo
Le 05/11/2010 16:42, Nathan a écrit : [skip] Sadly your proposed 210 still has it, the true problem isn't a status code thing, it's an "if I can GET it, it's a document", hence the earlier outlined problems with 303 as it stands, still the same problem. So, you are against hash URIs? Because if you can GET a hashless URI with 200 OK, then put a hash behind it and you can GET the resulting URI with a 200 OK too. According to httpRange-14, if the HTTP response code for a given URI is 2xx, then the URI denotes an information resource. Quote: """ a) If an "http" resource responds to a GET request with a 2xx response, then the resource identified by that URI is an information resource; """ GET http://liris.cnrs.fr/~azimmerm/antoine -> 200 OK -> it's a document! GET http://liris.cnrs.fr/~azimmerm/antoine#me -> 200 OK -> it's a document! GET http://liris.cnrs.fr/~azimmerm/antoine.rdf -> 200 OK -> it's a document! So your argument is moot since it is going against your own recommendation. I think that Ian's example with the Toucan is exactly the same as using hash URIs, that is, you have a different URI than the actual file URL for the "thing" but both the document's URL and the thing's URI are serving the same content. So, since Ian's idea is as much (or as little) deviant compared to httpRange-14, there are 2 solutions: everybody sticks strictly to 303, or we open up the options to 303 OR Hash-URIs OR Ian's solution. Additionally, having a supplementary code like David Wood suggests may help too. Regards, -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Schema Mappings (was Re: AW: ANN: LOD Cloud - Statistics and compliance with best practices)
Leigh, Le 22/10/2010 17:23, Leigh Dodds a écrit : Hi, On 22 October 2010 09:35, Chris Bizer wrote: Anja has pointed to a wealth of openly available numbers (no pun intended), that have not been discussed at all. For example, only 7.5% of the data source provide a mapping of "proprietary vocabulary terms" to "other vocabulary terms". For anyone building applications to work with LOD, this is a real problem. Yes, this is also the figure that scared me most. This might be low for a good reason: people may be creating proprietary terms because they don't feel well served by existing vocabularies and hence defining mappings (or even just reusing terms) may be difficult or even impossible. This also strikes me as an opportunity: someone could usefully build a service (perhaps built on facilities in Sindice) that aggregated schema information and provides tools for expressing simple mappings and equivalencies. It could fill a dual role: recommend more common/preferred terms, whilst simultaneously providing machine-readable equivalencies. This sounds very much like what an ontology alignment server is doing: it provides alignments [often synonym with mappings] on demand (given two ontology URIs), either by retrieving locally stored alignments, or by asking another alignment server for an alignment that it may have, or by computing the alignment on the fly, given a certain direct matching algorithm or from the aggregation (e.g., composition) of existing alignments. The alignment server can also be used for various other things such as comparing alignments, evaluating them, rating them, updating them, etc. A paper describing the Alignment server [1] has been submitted to the Semantic Web Journal and is under open review (you can read the paper and the reviews and submit your own reviews or comments). The server itself can be downloaded and installed anywhere [2]. I know that Uberblic provides some mapping tools in this area, allowing for the creation of a more normalized view across the web, but not sure how much of that is resurfaced. There are literally dozens of systems for ontology matching or schema mappings, which can more or less be used for Web Ontologies. Every year, a competition is organised [3] to evaluate the ontology matching tools, which features various tests among which several OWL ontology matching tasks. The output is a ranked list of equivalences or subsumption relations between the terms of the input ontologies. These tools are often unknown to the LOD enthusiasts although they could be obtained from their authors and tested on concrete cases. On the other side, the Ontology Matching crowd is always eager to find concrete applications to test their tools on real life problems. More information and some 500+ publications on the topic can be found on the ontologymatching.org [4]. Recall that ontology matching has its root in schema matching, which is---as Enrico Motta just said on this list---a 30 year old topic. [1] Jérôme Euzenat and Chan Le Duc. The Alignment server: storing and sharing alignments on the semantic web. http://www.semantic-web-journal.net/content/new-submission-alignment-server-storing-and-sharing-alignments-semantic-web [2] Alignment API and Alignment Server. http://alignapi.gforge.inria.fr/ [3] The Ontology Alignment Evaluation Initiative (AOEI). http://oaei.ontologymatching.org/ [4] http://www.ontologymatching.org/ Regards, -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Schema Mappings (was Re: AW: ANN: LOD Cloud - Statistics and compliance with best practices)
Leigh, Le 22/10/2010 17:23, Leigh Dodds a écrit : > Hi, > > On 22 October 2010 09:35, Chris Bizer wrote: >>> Anja has pointed to a wealth of openly >>> available numbers (no pun intended), that have not been discussed at all. >> For >>> example, only 7.5% of the data source provide a mapping of "proprietary >>> vocabulary terms" to "other vocabulary terms". For anyone building >>> applications to work with LOD, this is a real problem. >> >> Yes, this is also the figure that scared me most. > > This might be low for a good reason: people may be creating > proprietary terms because they don't feel well served by existing > vocabularies and hence defining mappings (or even just reusing terms) > may be difficult or even impossible. > > This also strikes me as an opportunity: someone could usefully build a > service (perhaps built on facilities in Sindice) that aggregated > schema information and provides tools for expressing simple mappings > and equivalencies. It could fill a dual role: recommend more > common/preferred terms, whilst simultaneously providing > machine-readable equivalencies. This sounds very much like what an ontology alignment server is doing: it provides alignments [often synonym with mappings] on demand (given two ontology URIs), either by retrieving locally stored alignments, or by asking another alignment server for an alignment that it may have, or by computing the alignment on the fly, given a certain direct matching algorithm or from the aggregation (e.g., composition) of existing alignments. The alignment server can also be used for various other things such as comparing alignments, evaluating them, rating them, updating them, etc. A paper describing the Alignment server [1] has been submitted to the Semantic Web Journal and is under open review (you can read the paper and the reviews and submit your own reviews or comments). The server itself can be downloaded and installed anywhere [2]. > I know that Uberblic provides some mapping tools in this area, > allowing for the creation of a more normalized view across the web, > but not sure how much of that is resurfaced. There are literally dozens of systems for ontology matching or schema mappings, which can more or less be used for Web Ontologies. Every year, a competition is organised [3] to evaluate the ontology matching tools, which features various tests among which several OWL ontology matching tasks. The output is a ranked list of equivalences or subsumption relations between the terms of the input ontologies. These tools are often unknown to the LOD enthusiasts although they could be obtained from their authors and tested on concrete cases. On the other side, the Ontology Matching crowd is always eager to find concrete applications to test their tools on real life problems. More information and some 500+ publications on the topic can be found on the ontologymatching.org [4]. Recall that ontology matching has its root in schema matching, which is---as Enrico Motta just said on this list---a 30 year old topic. [1] Jérôme Euzenat and Chan Le Duc. The Alignment server: storing and sharing alignments on the semantic web. http://www.semantic-web-journal.net/content/new-submission-alignment-server-storing-and-sharing-alignments-semantic-web [2] Alignment API and Alignment Server. http://alignapi.gforge.inria.fr/ [3] The Ontology Alignment Evaluation Initiative (AOEI). http://oaei.ontologymatching.org/ [4] http://www.ontologymatching.org/ Regards, -- Antoine Zimmermann Researcher at: Laboratoire d'InfoRmatique en Image et Systèmes d'information Database Group 7 Avenue Jean Capelle 69621 Villeurbanne Cedex France Lecturer at: Institut National des Sciences Appliquées de Lyon 20 Avenue Albert Einstein 69621 Villeurbanne Cedex France antoine.zimmerm...@insa-lyon.fr http://zimmer.aprilfoolsreview.com/
Re: Reification alternative
I see mainly 2 alternatives:
1) using quads;
2) using named graphs.
1) Quads
-
Quads simply add a fourth element to triples. That element can be used
for instance to annotated the triple, or name the triple for further
descriptions. With your example:
ex:User foaf:interest ex:Item ex:stmt1 .
ex:stmt1 rdfs:label "Statement that ..."@de ex:metastmt1 .
ex:stmt1 dc:publisher ex:Service ex:metastmt1 .
ex:stmt1 dc:created "2010-10-13"^^xsd:date ex:metastmt1 .
ex:stmt1 dc:license ex:License ex:metastmt1 .
Quads is not really a language for publishing data. It's rather a
convenient syntax to exchange multiple datasets. It does not have a
formal semantics.
2) Named Graphs
Named Graphs can be used to simply delimit what are the triples within
an RDF graph. Basically, you put a set of triples together and give a
name (a URI) to that set. To describe a single triple, you can make a
singleton named graph.
ex:stmt {
ex:User foaf:interest ex:Item ex:stmt1 .
}
ex:stmt rdfs:label "Statement that ..."@de .
ex:stmt dc:publisher ex:Service .
ex:stmt dc:created "2010-10-13"^^xsd:date .
ex:stmt dc:license ex:License .
You can assume that triples that are not in a graph (delimited by curly
brackets) are members of an implicit "default graph". Named Graphs are
not used to publish data either. They are normally used internally for
storing RDF data that come from different sources. While the semantic of
a single named graph is more or less explain in the specification, the
semantics of a multigraph document is undefined. This may evolve in the
near future since there are discussions about standardising named graphs.
Regards,
AZ.
Le 13/10/2010 15:02, Mirko a écrit :
Hi all,
I try to understand alternatives to reification for Linked Data publishing,
since reification is discouraged. For example, how could I express the
following without reification:
@prefix dc:<http://purl.org/dc/elements/1.1/>.
@prefix foaf:<http://xmlns.com/foaf/0.1/>.
<http://ex.org/stmt>
rdfs:label "Statement that describes user interest in a document"@de;
rdf:subject<http://ex.org/User>;
rdf:predicate foaf:interest;
rdf:object<http://ex.org/Item>;
dc:publisher<http://ex.org/Service>;
dc:created "2010-10-13"^^xsd:date;
dc:license<http://ex.org/License>.
<http://ex.org/User> rdf:type foaf:Agent.
<http://ex.org/Item> rdf:type foaf:Document.
Thanks,
Mirko
--
Antoine Zimmermann
Researcher at:
Laboratoire d'InfoRmatique en Image et Systèmes d'information
Database Group
7 Avenue Jean Capelle
69621 Villeurbanne Cedex
France
Lecturer at:
Institut National des Sciences Appliquées de Lyon
20 Avenue Albert Einstein
69621 Villeurbanne Cedex
France
antoine.zimmerm...@insa-lyon.fr
http://zimmer.aprilfoolsreview.com/
Re: FOAF DL
Beware, technical stuff follows. Le 16/07/2010 13:07, Dave Reynolds a écrit : Looks interesting. In the description you say "(1) foaf:mbox_sha1sum, foaf:jabberID, foaf:aimChatID, foaf:icqChatID, foaf:yahooChatID and foaf:msnChatID are not owl:InverseFunctionalProperties anymore; instead, they are defined as owl:Keys for foaf:Agents, which is practically the same" I agree that making them owl:Keys is the only option for DL but the comment "practically the same" is maybe overstating it. My understanding was that the semantics of Keys [1] only applies to named individuals and so isn't effective on anonymous individuals (which is a common use case in FOAF). Is that correct? Yes, you are correct. Here, I made a simplifying short cut but saying "practically the same". In most cases, a blank node can be simply considered as a named individual, using the blank node ID (regardless of whether it is specified in the serialisation or internally represented) as a "name" for the individual. In this case, the un-named individual are only those that exists because of inferences but which have no identifier at all (for instance, when using the OWL construct "owl:someValueFrom". Such shortcuts are practically used in reasoners to deduce things about blank nodes in the same way they deduce things about URIs. Using this approach on the following data: foaf:yahooChatID a owl:DatatypeProperty ; rdfs:domain foaf:Agent . foaf:Agent owl:hasKey ( foaf:yahooChatID ). _:bnode1 foaf:yahooChatID "xyz" . _:bnode2 foaf:yahooChatID "xyz" . one can infer: _:bnode1 owl:sameAs _:bnode2 . When the serialisation does not specify a name for a blank node, their is still an internal name somewhere. For instance: [ a :Person ] foaf:yahooChatID "xyz" ; foaf:firstName "John" . [ a :Person ] foaf:yahooChatID "xyz" ; foaf:lastName "Doe" . allows one to infer that there is one person with first name "John" and last name "Doe" (but its local identifier is only known to the reasoner). An example where the inference would not hold is as follows: :chatID a owl:DatatypeProperty ; rdfs:domain :Agent . :Agent owl:hasKey ( :chatID ). :hasFather a owl:ObjectProperty, owl:FunctionalProperty . :john :chatId "xyz" . :bob a [ owl:Restriction ; owl:onProperty :hasFather ; owl:allValuesFrom [ a owl:Restriction; owl:onProperty :chatId; owl:hasValue "xyz" ] ] . from this, we cannot conclude that John is the father of Bob, although Bob has a father (un-named) whose :chatId is exactly the same as John. If :chatId was inverse functional, we could conclude it. However, I said "practically the same" because this case is unlikely to occur in practice. Hope it's clear enough. For the specs for keys, see [1,2,3]. [1] OWL 2 Web Ontology Language - Structural Specification and Functional-Style Syntax, Sect.9.5 Keys. http://www.w3.org/TR/owl2-syntax/#Keys [2] OWL 2 Web Ontology Language - New Features and Rationale, Sect.2.2.6 F9: Keys. http://www.w3.org/TR/owl2-new-features/#F9:_Keys [3] OWL 2 Web Ontology Language - Direct Semantics, Sect.2.3.5 Keys. http://www.w3.org/TR/owl2-semantics/#Keys Regards, Dave [1] http://www.w3.org/TR/owl2-direct-semantics/#Keys On Fri, 2010-07-16 at 12:16 +0100, Antoine Zimmermann wrote: Dear all, I know that the compatibility of FOAF with OWL DL has been discussed a lot in the past (and still sometimes surfaces again). However, I'm wondering, would it be reasonable to provide a DL version of FOAF in complement of the official FOAF ontology? More generally, wouldn't it be reasonable to provide alternative versions of an ontology? Think of XHTML: there are three different XML Schemas for XHTML [1]. One could imagine alternative versions like FOAF (Full), FOAF-DL, FOAF-lite... Anyway, I did it: I've made a FOAF-DL ontology which modifies the FOAF ontology such that (1) it is in OWL 2 DL and (2) it maximally preserves inferences of the original FOAF ontology [2]. Interestingly, FOAF-DL is an OWL 2 RL ontology (in a nutshell, OWL 2 RL is a subset of OWL 2 DL with low computational complexity and that is compatible with rule-based inference engine). You may notice that there are strange annotation properties for this ontology: http://purl.org/az/foaf#";> ... http://xmlns.com/foaf/0.1/"/> ... The Yoda vocabulary [3] is used to relate alternative versions of an ontology. Here, it is said that there is a preferred version, which is the official FOAF ontology. Critiques to any of the previous comments are welcome. [1] http://www.w3.org/TR/xhtml1-schema/#schemas [2] The FOAF-DL ontology. http://purl.org/az/foaf [3] Yoda: A Vocabulary for Linking Alternative Spec
FOAF DL
Dear all, I know that the compatibility of FOAF with OWL DL has been discussed a lot in the past (and still sometimes surfaces again). However, I'm wondering, would it be reasonable to provide a DL version of FOAF in complement of the official FOAF ontology? More generally, wouldn't it be reasonable to provide alternative versions of an ontology? Think of XHTML: there are three different XML Schemas for XHTML [1]. One could imagine alternative versions like FOAF (Full), FOAF-DL, FOAF-lite... Anyway, I did it: I've made a FOAF-DL ontology which modifies the FOAF ontology such that (1) it is in OWL 2 DL and (2) it maximally preserves inferences of the original FOAF ontology [2]. Interestingly, FOAF-DL is an OWL 2 RL ontology (in a nutshell, OWL 2 RL is a subset of OWL 2 DL with low computational complexity and that is compatible with rule-based inference engine). You may notice that there are strange annotation properties for this ontology: http://purl.org/az/foaf#";> ... http://xmlns.com/foaf/0.1/"/> ... The Yoda vocabulary [3] is used to relate alternative versions of an ontology. Here, it is said that there is a preferred version, which is the official FOAF ontology. Critiques to any of the previous comments are welcome. [1] http://www.w3.org/TR/xhtml1-schema/#schemas [2] The FOAF-DL ontology. http://purl.org/az/foaf [3] Yoda: A Vocabulary for Linking Alternative Specifications of a Vocabulary. http://purl.org/NET/yoda Regards, -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: Capturing the discussion (RE: Subjects as Literals)
Sandro, all, I created the wikipage as you suggested. It is sketchy and certainly a bit biased towards my own opinion but I guess this will be improved as the document extends. Le 07/07/2010 05:01, Sandro Hawke a écrit : Would anyone be willing to try to capture the results of this thread in a page or two of consensus (neutral point-of-view) text that would explain the situation to at least a majority of the folks who've jumped in here with misunderstandings? To my reading, you (Michael) and Antoine are expressing that most clearly, if you'd be willing. Michael, feel free to modify my first input. It would be good, I think, to incorporate the ideas and perhaps the structure used at the workshop: http://www.w3.org/2001/sw/wiki/RDF_Core_Charter_2010#Literals_as_Subjects ... but probably do it on another wiki page, eg: http://www.w3.org/2001/sw/wiki/Literals_as_Subjects (which does not yet exist as I write this). We could think of this as a FAQ response, where the Questions are something like: Why can't I use Literals in the subject position in RDF? For me, the only answer I know to this question is: "You can't use literals as subjects because the spec says so." It would be good to have the history of this restriction to know why it was put in the spec in the first place. When are you going to change this? Hmm, can we really answer that question when the community is still very divided on whether it should be changed at all? How can I work around this restriction? and maybe: What would anyone want to use literals as subjects? What would it mean to use a literal as a predicate? Hoping someone will feel inspired to tie this up with a nice bow, -- Sandro Regards, AZ
Re: Subjects as Literals
So to clarify a bit: A serialisation is just a way to write down an RDF document in a computer. A serialisation of RDF must respect the abstract RDF syntax, which forbids literals in subject position. If the serialisation allows literals as subject, it is not a serialisation of RDF but it serialises a more general language (e.g., N3). Then comes the semantics. The semantics does not allow or disallow anything, it just provides a notion of interpretation of an RDF vocabulary, and a notion of satisfaction of an RDF document (which must *not* have a literal in subject position). However, what we mean by saying, informally, that "the semantics allows literals in subject" is that the very same semantics could be applied to generalised RDF. So, strictly speaking, no, the semantics does not allow you to put literals in subject, but it allows you to straightforwardly define the possible meaning of a generalised triple. AZ Le 06/07/2010 22:02, Nathan a écrit : Pat Hayes wrote: However, before I lose any more of my SW friends, let me say at once that I am NOT arguing for this change to RDF. so after hundreds of emails, I have to ask - what (the hell) defines RDF? I've read that 'The RDF Semantics as stated works fine with triples which have any kind of syntactic node in any position in any combination.' Do the 'RDF Semantics' define RDF? or do the serializations? simply - does RDF support literal subjects or not - I've read the aforementioned sentence to read 'RDF Semantics support literal subjects' or should I be reading 'RDF Semantics could support literal subjects' or 'does support literal subjects' or? Just seeking a definitive bit of clarity on 1: what defines RDF, 2: what is *currently* supported in that definition. Preferably a serialization unspecific answer :) Best & TIA, Nathan
Re: Subjects as Literals
I'd like to apologize in advance for being sarcastic, especially since I have really nothing against Henry... ;) Le 06/07/2010 19:45, Henry Story a écrit : This would be possible to say. The problem is that there would be no way on earth that anyone could come to an agreement as to what kind of property "lit" was. Everyone could make up defend their choice. And where there is no right or wrong, there is no meaning. Hence the above is undecidable. What is the difference between the above and foaf:knows a rdf:Property . What is the difference between the above and foaf:lit a rdf:Property . Well, we can dereference it and /not/ find out what it means. This is possible to say. The problem is that there is no way on earth that anyone can come to an agreement as to what kind of property foaf:lit is. Everyone can make up defend their choice. And where there is no right or wrong, there is no meaning. Hence, the above is undecidable. And therefore, URIs as subjects should be disallowed... ;) Well we can dereference foaf:knows to find out what it means. This is the canonical way to find it's meaning, and is the initial procedure we should use to arbitrate between competing understandings of its meaning. Henry Cheers, -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: Subjects as Literals
Ivan, all, Le 06/07/2010 18:00, Ivan Mikhailov a écrit : > After 7 days of discussion, are there any volunteers to implement this > proposal? Or you specify the wish and I should implement it (and > Kingsley should pay) for an unclear purpose? Sorry, no. Not only there are volunteers to implement tools which allow literals as subjects, but there are already implementations out there. As an example, take Ivan Herman's OWL 2 RL reasoner [1]. You can put triples with literals as subject, and it will reason with them. Here in DERI, we also have prototypes processing generalised triples. Other reasoners are dealing with literals as subjects. RIF implementations are also able to parse triples with literals as subjects, as it is required by the spec. In addition to the existing implementations, it should be noticed that the main standards built on top of RDF(S) (SPARQL, OWL 2, RIF) are all using generalised triples instead of the restrictive RDF triples. So, basically, all the upper levels of the Semantic Web layer cake are not based on RDF but on generalised RDF... Some people mentioned scalability issues when we allow literals as subject. It might be detrimental to the scalability of query engines over big triple stores, but allowing literals as subjects is perfectly scalable when it comes to inference materialisation (see recent work on computing the inference closure of 100 billion triples [2]). Considering this amount of usage and use cases, which is certainly meant to grow in the future, I believe that it is time to standardised generalised RDF. In addition, there are readily available serialisations for it (N3, or a straightforward extension of N-triple or Turtle) and a backward compatible extension of RDF/XML has been proposed in this thread (by Sandro Hawke). A possible compromise would be to define RDF 2 as /generalised RDF + named graphs + deprecate stuff/, and have a sublanguage (or profile) RDF# which forbids literals in subject and predicate positions, as well as bnodes in predicate position. Then SPARQL, OWL 2 and RIF would really refer to RDF 2 instead of each redifining generalised RDF. People implementing optimisations of triple stores would be implementing a W3C-approved part of RDF (namely, RDF#), just like people implementing OWL 2 QL implement part of OWL 2 for efficient data indexing and query answering. Honestly, it's just about putting a W3C stamp on things that some people are already using and doing. Just like named graphs and other stuff. Plus, it's an easy one since the semantics is already there. [1] http://www.ivan-herman.net/Misc/2008/owlrl/ [2] Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Frank van Harmelen, and Henri Bal. "OWL reasoning with WebPIE: calculating the closure of 100 billion triples" in the proceedings of ESWC 2010. Regards, AZ. -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: Show me the money - (was Subjects as Literals)
Jeremy, et al.,
I think people are already showing the money but they do it 2 cents
after 2 cents ;-) Here is my little 2 cent contribution.
To start with, I am on the side of the people in favour of allowing
literals in the subject position. I've read the discussion and pondered
the arguments on each side carefully, but I'm still convinced that it
would ultimately be the better option to allow them. I understand the
concern of those who would have to rework their architectures. Yet I
don't believe that the cost exceeds the benefits for those who are
starting to implement and for future implementations and future
developments of the standards.
As Sandro said, RIF is using triples with literals as subjects, as
Robert Fuller said (in the LOD list), reasoners are internally inferring
triples with literals in subject position, and other use cases (more or
less convincing) have been proposed here. Why can't those inferences and
facts be exposed and published in an RDF document?
Now I'd like to show some of the strange things that happen when you
combine SPARQL with inference regimes, that are due to the inability to
have literals (in the syntax) as subject.
Assume that you have the following data, harvested from the Web:
:www dc:creator "Tim Berners-Lee" .
:www dc:creator "Tim Berners-Lee"^^xsd:string .
:www dc:creator :timbl .
:timbl owl:sameAs "Tim Berners-Lee" .
Note that literals are commonly used with dc:creator so this example is
fairly realistic.
Now, let us consider the following query:
SELECT ?x WHERE {
?x a rdfs:Resource .
}
under the RDFS-entailment regime, this would provide the following answer:
?x --> :timbl
Now, the following query:
SELECT ?y WHERE {
?y a rdfs:Literal .
}
would provide no answer (under RDFS-entailment) and:
SELECT ?z WHERE {
?z a xsd:string .
}
would provide no answer (under RDFS-entailment).
Now, imagine a SPARQL engine with an "RDFS+sameAs"-entailment regime.
The three queries above would give the following results:
?x --> :timbl // first query
?y --> :timbl // second query (I can infer that :timbl is a rdfs:Literal)
and the last would give nothing.
Now consider the query:
SELECT ?t WHERE {
?u a rdfs:Literal .
?u owl:sameAs ?t .
}
It would give:
?t --> "Tim Berners-Lee"
?t --> :timbl
However, the query:
SELECT ?u WHERE {
?u a rdfs:Literal .
?u owl:sameAs ?t .
}
would give ?u -> :timbl .
This is very weird for me.
Anyway, I do not expect such a change in the near future and the spec
are like they are at the moment, so I live with it.
Regards,
--
Antoine Zimmermann
Post-doctoral researcher at:
Digital Enterprise Research Institute
National University of Ireland, Galway
IDA Business Park
Lower Dangan
Galway, Ireland
antoine.zimmerm...@deri.org
http://vmgal34.deri.ie/~antzim/
Re: Show me the money - (was Subjects as Literals)
Dear Tim,
Le 01/07/2010 20:03, Tim Finin a écrit :
On 7/1/10 2:51 PM, Henry Story wrote:
> ...
So just as a matter of interest, imagine a new syntax came along that
allowed literals in
subject position, could you not write a serialiser for it that turned
"123" length 3 .
Into
_:b owl:sameAs "123";
length 3.
?
So that really you'd have to do no work at all?
Just wondering
Isn't owl:sameAs defined to be a relation between two
URI references?
Not exactly. OWL DL defines this restriction on owl:sameAs, but
owl:sameAs is not itself defined like this. Plus, OWL DL is
syntactically a restriction of OWL (Full) (that is, a syntactic
restriction of RDF). The current discussion is about RDF, so I don't see
any reason to mention the specificities of OWL DL here. OWL DL, in any
case, would forbid literals in subject position.
Even if not, it is symmetric and
would have the above imply {"123" owl:sameAs _:b .}
No it does not imply this because "this" is not in the language. The
language RDF tells you that triples (the formulas in that language) have
no literals as subjects. In any logical formalism, you cannot infer
things that are not in the language.
This is actually what is strange about not allowing literals in the
subject position: you cannot say things like:
"123" owl:sameAs "123"
and therefore, you cannot infer it. If, for any reason, you want to
infer this, it means that you are in need of a modification of the RDF
language which allows literal in the subject position.
Yet, to make things more confusing, the interpretation of the predicate
owl:sameAs, under the OWL semantics, is reflexive and symmetric.
I am preparing an email about the weird consequences of excluding
literals in subject position.
Regards,
--
Antoine Zimmermann
Post-doctoral researcher at:
Digital Enterprise Research Institute
National University of Ireland, Galway
IDA Business Park
Lower Dangan
Galway, Ireland
antoine.zimmerm...@deri.org
http://vmgal34.deri.ie/~antzim/
Re: 'owl:Class and rdfs:Class' vs. 'owl:Class or rdfs:Class'
I don't think there is an established best practice related to this topic. Moreover, your choice may depend on your application, use case, practical needs, etc. However, as far as I can foresee, using both rdfs:Class and owl:Class is perfectly safe wrt to RDF/RDFS tools and perfectly safe wrt OWL tools. AZ Le 16/06/2010 12:08, Bob Ferris a écrit : Hi, does anyone know of an already defined best practice re. using 'owl:Class and rdfs:Class' vs. 'owl:Class or rdfs:Class' type definition for concepts in ontologies? (I've searched at ontologydesignpatterns.org for it, but didn't found something). For example the FOAF ontology uses both types in their ontology definition [1] (for better reading ;) ). However, I think this depends on the evolution of the FOAF ontology, that means it was first defined only by using rdfs:Class and owl:Class was added later. On the other side, for example the Music Ontology [2] uses only owl:Class for its concept definitions (which was design some year later). The reason for supporting both is that RDFS only systems are then also able to process semantic graphs from ontologies with rdfs:Class typed concepts. On the other side, modern SPARQL engines, such as this one from the Virtuoso Server [3], are able to handle transitivity - a feature, which is very important re. ontologies (I think). Cheers, Bob [1] http://www1.inf.tu-dresden.de/~s9736463/ontologies/FOAF_-_20100101.n3 [2] http://motools.sourceforge.net/doc/musicontology.n3 [3] http://virtuoso.openlinksw.com/features-comparison-matrix/ -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: MuSim Ontology problems (was Re: Share, Like Ontology)
well-defined range, which expresses that the values are number. I can't really imagine other values that are might used here. The XSD namespace is a kind of best practice for defining the Datatypes. Reusing the value would be straightforward. In practice, the value will be computed in such a way that it is a number (or maybe "NaN", if relevant) and will most likely be given a datatype. In the end, the data will contain something like: ex:sim :distance "389.009"^^xsd:float . There is no problem reusing this value, regardless of the range definition. However, *if* the range constraint is maintained as you suggest, the following triples would be each individually inconsistent wrt the ontology: ex:sim :distance "389.009" . ex:sim :distance "NaN" . ex:sim :distance "389.009"^^xsd:decimal . ex:sim :distance "389.009"^^owl:real . ex:sim :distance "0fb7"^^xsd:hexBinary . ex:sim :distance "6z2b76aa"^^xsd:base64Binary . Yet, it's easy to make a programme that deals equally well with all these values, whereas it is difficult to ensure that everybody will use the three datatypes mentioned in the range assertion. In the absence of range assertion, such values as: ex:sim :distance "very similar" . ex:sim :distance "+++"^^xsd:string . would be consistent wrt the ontology but they can be simply ignored by any programme using these values. In the presence of the range assertion, these triples would be inconsistent wrt the ontology, but this does not prevent anybody from writing them, so they would have to be dealt with somehow too. This discussion reminds me a bit of http://www.w3.org/DesignIssues/InterpretationProperties.html. I don't think there's anything wrong with either approach. It is perfectly ok to put such a range constraint in the ontology. When building an aggregator of MuSim data, it is much easier to know what to expect (and what to eventually reject - in case it is inconsistent wrt the ontology) rather than committing to support all possible datatypes! On the other hand, it's fine to leave it open - you gain in flexibility. Kind regards, y -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: MuSim Ontology problems (was Re: Share, Like Ontology)
absence of range assertion, such values as: ex:sim :distance "very similar" . ex:sim :distance "+++"^^xsd:string . would be consistent wrt the ontology but they can be simply ignored by any programme using these values. In the presence of the range assertion, these triples would be inconsistent wrt the ontology, but this does not prevent anybody from writing them, so they would have to be dealt with somehow too. Regards, -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: Share, Like Ontology
tructural Specification and Functional-Style Syntax, W3C Recommendation 27 October 2009. Section "4.2 Floating-Point Numbers", http://www.w3.org/TR/owl2-syntax/#Datatype_Maps Le 11/06/2010 19:20, Kurt J a écrit : I've developed an ontology for describing similarity between things. Not directly applicable to "like" and "share" but possibly of interest. http://purl.org/ontology/similarity/ Note the most significant design decision is to make a similarity a class rather than a property. This same approach might make sense for "like" and "share" allowing you to bind properties to these things. I argue this enables more intuitive queries such as "show me all the 'likes' from this person from this info service". -kurt j On Fri, Jun 11, 2010 at 12:54 PM, Stéphane Corlosquet wrote: Nathan, Have you looked at http://ontologi.es/like# ? Steph. On Fri, Jun 11, 2010 at 11:29 AM, Nathan wrote: Hi All, Before I give it a quick go, has anybody created an ontology for likes, resharing things etc ? Best, Nathan -- Antoine Zimmermann Post-doctoral researcher at: Digital Enterprise Research Institute National University of Ireland, Galway IDA Business Park Lower Dangan Galway, Ireland antoine.zimmerm...@deri.org http://vmgal34.deri.ie/~antzim/
Re: [pedantic-web] dealing with attachments / images..
Nathan, pedants, A rather general remark in reaction to your question. In order to find ontologies and terms of ontologies (classes, properties), you can use ontology search engines such as OntoSelect [1], Watson [2], OntoSearch [3], OntoSearch2 [4] or more general Semantic Web search engines such as Falcons [5], SWSE [6], Sindice [7] or Swoogle [8]. One drawback of these systems is that they tend to put forward big ontologies that are not necessarily popular and which may not be the best to use for the Linked Data community. DERI is also working on an ontology-term-search engine, but I'm not sure the prototype we have is publicly available. [1] OntoSelect: http://olp.dfki.de/ontoselect [2] Watson: http://watson.kmi.open.ac.uk/ [3] OntoSearch: http://eprints.aktors.org/369/ [4] OntoSearch2: http://www.ontosearch.org/ [5] Falcons: http://iws.seu.edu.cn/services/falcons/objectsearch/index.jsp [6] SWSE: http://swse.org/ [7] Sindice: http://sindice.com/ [8] Swoogle: http://swoogle.umbc.edu/ When it comes to finding ontologies, Watson is pretty good. When it comes to finding concepts, Falcons is, AFAICT, better. For finding instances, SWSE is good. For finding Semantic Web documents in general, Sindice may be a good choice. I'm wondering if this should be referenced on the Pedantic Web website. Regards, AZ. 2009/11/30 Nathan : > Hi All, > > Background, Ihave a sioc:Post which (when rendered as html) visually > contains 3 images, with captions and licenses, creators etc. > > q: how to deal with these images in rdf terms..? > if anybody is doing this already, please do share. > > immediate thoughts are that: > > > rdf:type ; > rdf:type ; > sioc:about ; > sioc:link ; > foaf:thumbnail ; > foaf:content "description of image"@en ; > > where I'm running short is how to express height/width and it there are > any other ontologies with a class of Image and related properties for > width/height etc. kinda like mrss i guess. > > regards & thanks in advance > > Nathan > -- --AZ
