Common Sense Reasoning with the Semantic Web
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Semantics Developer's Guide
MarkLogic Server Semantic Graph Developer’s Guide 2 MarkLogic 10 May, 2019 Last Revised: 10.0-8, October, 2021 Copyright © 2021 MarkLogic Corporation. All rights reserved. MarkLogic Server MarkLogic 10—May, 2019 Semantic Graph Developer’s Guide—Page 2 MarkLogic Server Table of Contents Table of Contents Semantic Graph Developer’s Guide 1.0 Introduction to Semantic Graphs in MarkLogic ..........................................11 1.1 Terminology ..........................................................................................................12 1.2 Linked Open Data .................................................................................................13 1.3 RDF Implementation in MarkLogic .....................................................................14 1.3.1 Using RDF in MarkLogic .........................................................................15 1.3.1.1 Storing RDF Triples in MarkLogic ...........................................17 1.3.1.2 Querying Triples .......................................................................18 1.3.2 RDF Data Model .......................................................................................20 1.3.3 Blank Node Identifiers ..............................................................................21 1.3.4 RDF Datatypes ..........................................................................................21 1.3.5 IRIs and Prefixes .......................................................................................22 1.3.5.1 IRIs ............................................................................................22 -
Binary RDF for Scalable Publishing, Exchanging and Consumption in the Web of Data
WWW 2012 – PhD Symposium April 16–20, 2012, Lyon, France Binary RDF for Scalable Publishing, Exchanging and Consumption in the Web of Data Javier D. Fernández 1;2 Supervised by: Miguel A. Martínez Prieto 1 and Claudio Gutierrez 2 1 Department of Computer Science, University of Valladolid (Spain) 2 Department of Computer Science, University of Chile (Chile) [email protected] ABSTRACT era and hence they share a document-centric view, providing The Web of Data is increasingly producing large RDF data- human-focused syntaxes, disregarding large data. sets from diverse fields of knowledge, pushing the Web to In a typical scenario within the current state-of-the-art, a data-to-data cloud. However, traditional RDF represen- efficient interchange of RDF data is limited, at most, to com- tations were inspired by a document-centric view, which pressing the verbose plain data with universal compression results in verbose/redundant data, costly to exchange and algorithms. The resultant file has no logical structure and post-process. This article discusses an ongoing doctoral the- there is no agreed way to efficiently publish such data, i.e., sis addressing efficient formats for publication, exchange and to make them (publicly) available for diverse purposes and consumption of RDF on a large scale. First, a binary serial- users. In addition, the data are hardly usable at the time of ization format for RDF, called HDT, is proposed. Then, we consumption; the consumer has to decompress the file and, focus on compressed rich-functional structures which take then, to use an appropriate external tool (e.g. -
Extracting Common Sense Knowledge from Text for Robot Planning
Extracting Common Sense Knowledge from Text for Robot Planning Peter Kaiser1 Mike Lewis2 Ronald P. A. Petrick2 Tamim Asfour1 Mark Steedman2 Abstract— Autonomous robots often require domain knowl- edge to act intelligently in their environment. This is particu- larly true for robots that use automated planning techniques, which require symbolic representations of the operating en- vironment and the robot’s capabilities. However, the task of specifying domain knowledge by hand is tedious and prone to error. As a result, we aim to automate the process of acquiring general common sense knowledge of objects, relations, and actions, by extracting such information from large amounts of natural language text, written by humans for human readers. We present two methods for knowledge acquisition, requiring Fig. 1: The humanoid robots ARMAR-IIIa (left) and only limited human input, which focus on the inference of ARMAR-IIIb working in a kitchen environment ([5], [6]). spatial relations from text. Although our approach is applicable to a range of domains and information, we only consider one type of knowledge here, namely object locations in a kitchen environment. As a proof of concept, we test our approach using domain knowledge based on information gathered from an automated planner and show how the addition of common natural language texts. These methods will provide the set sense knowledge can improve the quality of the generated plans. of object and action types for the domain, as well as certain I. INTRODUCTION AND RELATED WORK relations between entities of these types, of the kind that are commonly used in planning. As an evaluation, we build Autonomous robots that use automated planning to make a domain for a robot working in a kitchen environment decisions about how to act in the world require symbolic (see Fig. -
RDF Query Languages Need Support for Graph Properties
RDF Query Languages Need Support for Graph Properties Renzo Angles1, Claudio Gutierrez1, and Jonathan Hayes1,2 1 Dept. of Computer Science, Universidad de Chile 2 Dept. of Computer Science, Technische Universit¨at Darmstadt, Germany {rangles,cgutierr,jhayes}@dcc.uchile.cl Abstract. This short paper discusses the need to include into RDF query languages the ability to directly query graph properties from RDF data. We study the support that current RDF query languages give to these features, to conclude that they are currently not supported. We propose a set of basic graph properties that should be added to RDF query languages and provide evidence for this view. 1 Introduction One of the main features of the Resource Description Framework (RDF) is its ability to interconnect information resources, resulting in a graph-like structure for which connectivity is a central notion [GLMB98]. As we will argue, basic concepts of graph theory such as degree, path, and diameter play an important role for applications that involve RDF querying. Considering the fact that the data model influences the set of operations that should be provided by a query language [HBEV04], it follows the need for graph operations support in RDF query languages. For example, the query “all relatives of degree 1 of Alice”, submitted to a genealogy database, amounts to retrieving the nodes adjacent to a resource. The query “are suspects A and B related?”, submitted to a police database, asks for any path connecting these resources in the (RDF) graph that is stored in this database. The query “what is the Erd˝osnumber of Alberto Mendelzon”, submitted to (a RDF version of) DBLP, asks simply for the length of the shortest path between the nodes representing Erd˝osand Mendelzon. -
Exercise Sheet 1
Semantic Web, SS 2017 1 Exercise Sheet 1 RDF, RDFS and Linked Data Submit your solutions until Friday, 12.5.2017, 23h00 by uploading them to ILIAS. Later submissions won't be considered. Every solution should contain the name(s), email adress(es) and registration number(s) of its (co-)editor(s). Read the slides for more submission guidelines. 1 Knowledge Representation (4pts) 1.1 Knowledge Representation Humans usually express their knowledge in natural language. Why aren't we using, e.g., English for knowledge representation and the semantic web? 1.2 Terminological vs Concrete Knowledge What is the role of terminological knowledge (e.g. Every company is an organization.), and what is the role of facts (e.g. Microsoft is an organization. Microsoft is headquartered in Redmond.) in a semantic web system? Hint: Imagine an RDF ontology that contains either only facts (describing factual knowledge: states of aairs) or constraints (describing terminological knowledge: relations between con- cepts). What could a semantic web system do with it? Semantic Web, SS 2017 2 2 RDF (10pts) RDF graphs consist of triples having a subject, a predicate and an object. Dierent syntactic notations can be used in order to serialize RDF graphs. By now you have seen the XML and the Turtle syntax of RDF. In this task we will use the Notation3 (N3) format described at http://www.w3.org/2000/10/swap/Primer. Look at the following N3 le: @prefix model: <http://example.com/model1/> . @prefix cdk: <http://example.com/chemistrydevelopmentkit/> . @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> . -
Open Mind Common Sense: Knowledge Acquisition from the General Public
Open Mind Common Sense: Knowledge Acquisition from the General Public Push Singh, Grace Lim, Thomas Lin, Erik T. Mueller Travell Perkins, Mark Tompkins, Wan Li Zhu MIT Media Laboratory 20 Ames Street Cambridge, MA 02139 USA {push, glim, tlin, markt, wlz}@mit.edu, [email protected], [email protected] Abstract underpinnings for commonsense reasoning (Shanahan Open Mind Common Sense is a knowledge acquisition 1997), there has been far less work on finding ways to system designed to acquire commonsense knowledge from accumulate the knowledge to do so in practice. The most the general public over the web. We describe and evaluate well-known attempt has been the Cyc project (Lenat 1995) our first fielded system, which enabled the construction of which contains 1.5 million assertions built over 15 years a 400,000 assertion commonsense knowledge base. We at the cost of several tens of millions of dollars. then discuss how our second-generation system addresses Knowledge bases this large require a tremendous effort to weaknesses discovered in the first. The new system engineer. With the exception of Cyc, this problem of scale acquires facts, descriptions, and stories by allowing has made efforts to study and build commonsense participants to construct and fill in natural language knowledge bases nearly non-existent within the artificial templates. It employs word-sense disambiguation and intelligence community. methods of clarifying entered knowledge, analogical inference to provide feedback, and allows participants to validate knowledge and in turn each other. Turning to the general public 1 In this paper we explore a possible solution to this Introduction problem of scale, based on one critical observation: Every We would like to build software agents that can engage in ordinary person has common sense of the kind we want to commonsense reasoning about ordinary human affairs. -
Commonsense Knowledge Base Completion with Structural and Semantic Context
Commonsense Knowledge Base Completion with Structural and Semantic Context Chaitanya Malaviya}, Chandra Bhagavatula}, Antoine Bosselut}|, Yejin Choi}| }Allen Institute for Artificial Intelligence |University of Washington fchaitanyam,[email protected], fantoineb,[email protected] Abstract MotivatedByGoal prevent go to tooth Automatic KB completion for commonsense knowledge dentist decay eat graphs (e.g., ATOMIC and ConceptNet) poses unique chal- candy lenges compared to the much studied conventional knowl- HasPrerequisite edge bases (e.g., Freebase). Commonsense knowledge graphs Causes brush use free-form text to represent nodes, resulting in orders of your tooth HasFirstSubevent Causes magnitude more nodes compared to conventional KBs ( ∼18x tooth bacteria decay more nodes in ATOMIC compared to Freebase (FB15K- pick 237)). Importantly, this implies significantly sparser graph up your toothbrush structures — a major challenge for existing KB completion ReceivesAction methods that assume densely connected graphs over a rela- HasPrerequisite tively smaller set of nodes. good Causes breath NotDesires In this paper, we present novel KB completion models that treat by can address these challenges by exploiting the structural and dentist infection semantic context of nodes. Specifically, we investigate two person in cut key ideas: (1) learning from local graph structure, using graph convolutional networks and automatic graph densifi- cation and (2) transfer learning from pre-trained language Figure 1: Subgraph from ConceptNet illustrating semantic models to knowledge graphs for enhanced contextual rep- diversity of nodes. Dashed blue lines represent potential resentation of knowledge. We describe our method to in- edges to be added to the graph. corporate information from both these sources in a joint model and provide the first empirical results for KB com- pletion on ATOMIC and evaluation with ranking metrics on ConceptNet. -
Conceptnet 5.5: an Open Multilingual Graph of General Knowledge
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) ConceptNet 5.5: An Open Multilingual Graph of General Knowledge Robyn Speer Joshua Chin Catherine Havasi Luminoso Technologies, Inc. Union College Luminoso Technologies, Inc. 675 Massachusetts Avenue 807 Union St. 675 Massachusetts Avenue Cambridge, MA 02139 Schenectady, NY 12308 Cambridge, MA 02139 Abstract In this paper, we will concisely represent assertions such Machine learning about language can be improved by sup- as the above as triples of their start node, relation label, and plying it with specific knowledge and sources of external in- end node: the assertion that “a dog has a tail” can be repre- formation. We present here a new version of the linked open sented as (dog, HasA, tail). data resource ConceptNet that is particularly well suited to ConceptNet also represents links between knowledge re- be used with modern NLP techniques such as word embed- sources. In addition to its own knowledge about the English dings. term astronomy, for example, ConceptNet contains links to ConceptNet is a knowledge graph that connects words and URLs that define astronomy in WordNet, Wiktionary, Open- phrases of natural language with labeled edges. Its knowl- Cyc, and DBPedia. edge is collected from many sources that include expert- The graph-structured knowledge in ConceptNet can be created resources, crowd-sourcing, and games with a pur- particularly useful to NLP learning algorithms, particularly pose. It is designed to represent the general knowledge in- those based on word embeddings, such as (Mikolov et al. volved in understanding language, improving natural lan- 2013). We can use ConceptNet to build semantic spaces that guage applications by allowing the application to better un- are more effective than distributional semantics alone. -
Use Style: Paper Title
IJRECE VOL. 6 ISSUE 2 APR.-JUNE 2018 ISSN: 2393-9028 (PRINT) | ISSN: 2348-2281 (ONLINE) A Review on Reasoning System, Types and Tools and Need for Hybrid Reasoning Goutami M.K1, Mrs. Rashmi S R2, Bharath V3 1M.Tech, Computer Network Engineering, Dept. of Computer Science and Engineering, Dayananda Sagar college of Engineering, Bangalore. (Email: [email protected]) 2Asst. Professor, Dept. of Computer Science and Engineering, Dayananda Sagar college of Engineering , Bangalore. (Email: [email protected]) 3Dept. of Computer Science and Engineering, Dayananda Sagar college of Engineering, Bangalore Abstract— Expert system is a programming system which knowledge base then we require a programming system that utilizes the information of expert knowledge of the specific will facilitate us to access the knowledge for reasoning purpose domain to make decisions. These frameworks are intended to and helps in decision making and problem solving. Inference tackle complex issues by thinking through the learning process engine is an element of the system that applies logical rules to called as reasoning. The knowledge used for reasoning is the knowledge base to deduce new information. User interface represented mainly as if-then rules. Expert system forms a is one through which the user can communicate with the expert significant part in day-to-day life nowadays as it emulates the system. expert’s behavior in analyzing the information and concludes “A reasoning system is a software system that uses available knowledge, applies logical techniques to generate decision. This paper primarily centers on the reasoning system conclusions”. It uses logical techniques such as deduction which plays the fundamental part in field of artificial approach and induction approach. -
Resource Description Framework Technologies in Chemistry Egon L Willighagen1* and Martin P Brändle2
Willighagen and Brändle Journal of Cheminformatics 2011, 3:15 http://www.jcheminf.com/content/3/1/15 EDITORIAL Open Access Resource description framework technologies in chemistry Egon L Willighagen1* and Martin P Brändle2 Editorial would like to thank Pfizer, Inc., who had partially The Resource Description Framework (RDF) is provid- funded the article processing charges for this Thematic ing the life sciences with new standards around data Series. Pfizer, Inc. has had no input into the content of and knowledge management. The uptake in the life the publication or the articles themselves. All articles in sciences is significantly higher than the uptake of the the series were independently prepared by the authors eXtensible Markup Language (XML) and even relational and were subjected to the journal’s standard peer review databases, as was recently shown by Splendiani et al. [1] process. Chemistry is adopting these methods too. For example, In the remainder of this editorial, we will briefly out- Murray-Rust and co-workers used RDF already in 2004 line the various RDF technologies and how they have to distribute news items where chemical structures were been used in chemistry so far. embedded using RDF Site Summary 1.0 [2]. Frey imple- mented a system which would now be referred to as an 1 Concepts electronic lab notebook (ELN) [3]. The use of the The core RDF specification was introduced by the SPARQL query language goes back to 2007 where it World Wide Web Consortium (W3C) in 1999 [6] and was used in a system to annotate crystal structures [4]. defines the foundation of the RDF technologies. -
Connecting RDA and RDF Linked Data for a Wide World of Connected Possibilities
Practice Connecting RDA and RDF Linked Data for a Wide World of Connected Possibilities Ashleigh Faith & Michelle Chrzanowski Ashleigh N. Faith, MLIS is an Adjunct Instructor at the University of Pittsburgh Information School, [email protected] Michelle Chrzanowski, MLS is a Reference Librarian at the Tidewater Community College Norfolk Campus Library, [email protected] Libraries have struggled with connecting a plethora of content and the metadata stored in catalogs to patrons. Adding more value to catalogs, more tools for reference librarians, and enriched patron search, linked data is a means to connect more people with more relevant information. With the recent transition to the Resource Description and Access (RDA) cataloging standard within libraries, linking data in library databases has become a much easier project to tackle, largely because of another standard called Resource Description Framework (RDF). Both focus on resource description and both are components of linked data within the library. Tying them together is the Functional Requirements for Bibliographic Records (FRBR) conceptual framework. Acknowledging that linked data components are most likely new to many librarians, this article seeks to explain what linked data is, how RDA and RDF are connected by FRBR, and how knowledge maps may improve information access. Introduction Interest in linked data has been growing. Recently, a search of the abstract databases Scopus, Web of Science, and Google Scholar show “linked data” as a search term an average of 45,633 times from 2010 to July 2015. From January to July 2015 alone, "linked data" was searched an average of 3,573 times. It is therefore no wonder that more people are paying attention to data and how it can be linked to other data. -
Analogyspace: Reducing the Dimensionality of Common Sense
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) AnalogySpace: Reducing the Dimensionality of Common Sense Knowledge Robyn Speer Catherine Havasi Henry Lieberman CSAIL Laboratory for Linguistics and Computation Software Agents Group Massachusetts Institute of Technology Brandeis University MIT Media Lab Cambridge, MA 02139, USA Waltham, MA 02454, USA Cambridge, MA 02139, USA [email protected] [email protected] [email protected] Abstract to reduce the dimensionality of that matrix. This results in computing principal components which represent the most We are interested in the problem of reasoning over very large salient aspects of the knowledge, which can then be used to common sense knowledge bases. When such a knowledge base contains noisy and subjective data, it is important to organize it along the most semantically meaningful dimen- have a method for making rough conclusions based on simi- sions. The key idea is that semantic similarity can be deter- larities and tendencies, rather than absolute truth. We present mined using linear operations over the resulting vectors. AnalogySpace, which accomplishes this by forming the ana- logical closure of a semantic network through dimensionality What AnalogySpace Can Do reduction. It self-organizes concepts around dimensions that can be seen as making distinctions such as “good vs. bad” AnalogySpace provides a computationally efficient way to or “easy vs. hard”, and generalizes its knowledge by judging calculate a wide variety of semantically meaningful opera- where concepts lie along these dimensions. An evaluation tions: demonstrates that users often agree with the predicted knowl- AnalogySpace can generalize from sparsely-collected edge, and that its accuracy is an improvement over previous knowledge.