Hybrid MKNF knowledge bases are one of the most prominent tightly integrated combinations of open-world ontology languages with closed-world (non-monotonic) rule paradigms. The definition of Hybrid MKNF is parametric on the description logic (DL) underlying the ontology language, in the sense that non-monotonic rules can extend any decidable DL language. Two related semantics have been defined for Hybrid MKNF: one that is based on the Stable Model Semantics for logic programs and one on the Well-Founded Semantics (WFS). Under WFS, the definition of Hybrid MKNF relies on a bottom-up computation that has polynomial data complexity whenever the DL language is tractable. Here we define a general query-driven procedure for Hybrid MKNF that is sound with respect to the stable model-based semantics, and sound and complete with respect to its WFS variant. This procedure is able to answer a slightly restricted form of conjunctive queries, and is based on tabled rule evaluation extended with an external oracle that captures reasoning within the ontology. Such an (abstract) oracle receives as input a query along with knowledge already derived, and replies with a (possibly empty) set of atoms, defined in the rules, whose truth would suffice to prove the initial query. With appropriate assumptions on the complexity of the abstract oracle, the general procedure maintains the data complexity of the WFS for Hybrid MKNF knowledge bases. To illustrate this approach, we provide a concrete oracle for EL+, a fragment of the light-weight DL EL++. Such an oracle has practical use, as EL++ is the language underlying OWL 2 EL, which is part of the W3C recommendations for the Semantic Web, and is tractable for reasoning tasks such as subsumption. We show that query-driven Hybrid MKNF preserves polynomial data complexity when using the EL+ oracle and WFS.

The size of 3D models used on the web or stored in databases is becoming increasingly high. Then, an efficient method that allows users to find similar 3D objects for a given 3D model query has become necessary. Keywords and the geometry of a 3D model cannot meet the needs of users' retrieval because they do not include the semantic information. In this paper, a new method has been proposed to 3D models retrieval using semantic concepts combined with shape indexes. To obtain these concepts, we use the machine learning methods to label 3D models by k-means algorithm in measures and shape indexes space. Moreover, semantic concepts have been organized and represented by ontology language OWL and spatial relationships are used to disambiguate among models of similar appearance. The SPARQL query language has been used to question the information displayed in this language and to compute the similarity between two 3D models. We interpret our results using the Princeton Shape Benchmark Database and the results show the performance of the proposed new approach to retrieval 3D models. Keywords: 3D Model, 3D retrieval, measures, shape indexes, semantic, ontology

A critical prerequisite for human-level cognitive systems is having a rich conceptual understanding of the world. We describe a system that learns conceptual knowledge by deep understanding of WordNet glosses. While WordNet is often criticized for having a too fine-grained approach to word senses, the set of glosses do generally capture useful knowledge about the world and encode a substantial knowledge base about everyday concepts. Unlike previous approaches that have built ontologies of atomic concepts from the provided WordNet hierarchies, we construct complex concepts compositionally using description logic and perform reasoning to derive the best classification of knowledge. We view this work as simultaneously accomplishing two goals: building a rich semantic lexicon useful for natural language processing, and building a knowledge base that encodes common-sense knowledge.

According to Baddeley, "The episodic buffer is assumed to be a limitedcapacity Our research team has been working on the development of a language analysis model (Ball, 2011; Ball, Heiberg & temporary storage system that is capable of Silber, 2007) within the ACT-R cognitive architecture integrating information from a variety of sources…the (Anderson, 2007) since 2002 (Ball, 2004). The focus is on buffer provides not only a mechanism for modeling the development of a general-purpose, large-scale, functional environment, but also for creating new cognitive model (Ball, 2008; Ball et al., 2010) that adheres to well representations" (ibid, p. 421). A key empirical result which established cognitive constraints on human language motivated Baddeley to introduce the episodic buffer after 25 processing (HLP) as realized by ACT-R.

This paper describes a prototype system that generates mathematical word problems from ontologies in unrestricted domains. It builds on an existing ontology verbaliser that renders logical statements written in Web Ontology Language (OWL) as English sentences. This kind of question is more complex than those normally attempted by question generation systems, since mathematical word problems consist of a number of sentences that communicate a short narrative (in addition to providing the relevant numerical information required to solve the underlying mathematical problem). Thus, they embody many research issues that do not crop up with single-sentence questions. As well as describing the prototype system, I discuss five ways in which the difficulty of the generated questions may be controlled automatically during generation.

Historically, approaches to human-level intelligence have divided between those emphasizing the mechanisms involved, such as cognitive architectures, and those focusing on the knowledge content, such as ontologies. In this paper we argue that in order to build cognitive systems capable of human-level event-recognition, a comprehensive infrastructure of perceptual and cognitive mechanisms coupled with high-level knowledge representations is required. In particular, our contribution focuses on an integrated modeling framework (the “Cognitive Engine”), where the learning and knowledge retrieval mechanisms of the ACT-R cognitive architecture are combined with integrated semantic resources for the purpose of event interpretation.

Language processing architectures today are rarely designed to provide psychologically plausible accounts of their representations and algorithms. Engineering decisions dominate. This has led to words being seen as an incidental part of the architecture: the repository of all of language’s idiosyncratic aspects. Drawing on a body of past and ongoing research by myself and others I have concluded that this view of words is wrong. Words are actually present at the most abstract, pre-linguistic levels of the NLP architecture and that there are phenomena in language use that are best accounted for by assuming that concepts are words.

An important form of learning involves acquiring skills that let an agent achieve its goals. While there has been considerable work on learning in planning, most approaches have been sensitive to the representation of domain context, which hurts their generality. A learning mechanism that constructs skills effectively across different representations would suggest more robust behavior. In this paper, we present a novel approach to learning hierarchical task networks that acquires conceptual predicates as learning proceeds, making it less dependent on carefully crafted background knowledge. The representation acquisition procedure expands the system's knowledge about the world, and leads to more rapid learning. We show the effectiveness of the approach by comparing it with one that doesnot change domain representation.

It is widely recognized today that the management of imprecision and vagueness will yield more intelligent and realistic knowledge-based applications. Description Logics (DLs) are a family of knowledge representation languages that have gained considerable attention the last decade, mainly due to their decidability and the existence of empirically high performance of reasoning algorithms. In this paper, we extend the well known fuzzy ALC DL to the fuzzy SHIN DL, which extends the fuzzy ALC DL with transitive role axioms (S), inverse roles (I), role hierarchies (H) and number restrictions (N). We illustrate why transitive role axioms are difficult to handle in the presence of fuzzy interpretations and how to handle them properly. Then we extend these results by adding role hierarchies and finally number restrictions. The main contributions of the paper are the decidability proof of the fuzzy DL languages fuzzy-SI and fuzzy-SHIN, as well as decision procedures for the knowledge base satisfiability problem of the fuzzy-SI and fuzzy-SHIN.

Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts, based on base concepts. For example, rules allow to define the extension of a class or property, based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-as-failure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on Partial Logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.