257,162 research outputs found
Cognitive context and arguments from ontologies for learning
The deployment of learning resources on the web by different experts has resulted in the accessibility of multiple viewpoints about the same topics. In
this work we assume that learning resources are underpinned by ontologies. Different formalizations of domains may result from different contexts, different use of
terminology, incomplete knowledge or conflicting knowledge. We define the notion of cognitive learning context which describes the cognitive context of an agent who refers to multiple and possibly inconsistent ontologies to determine the truth of a proposition. In particular we describe the cognitive states of ambiguity and inconsistency
resulting from incomplete and conflicting ontologies respectively. Conflicts between ontologies can be identified through the derivation of conflicting arguments
about a particular point of view. Arguments can be used to detect inconsistencies between ontologies. They can also be used in a dialogue between a human learner and a software tutor in order to enable the learner to justify her views and detect inconsistencies between her beliefs and the tutor’s own. Two types of arguments are discussed, namely: arguments inferred directly from taxonomic relations
between concepts, and arguments about the necessary an
Knowledge Representation with Ontologies: The Present and Future
Recently, we have seen an explosion of interest in ontologies as
artifacts to represent human knowledge and as critical components in
knowledge management, the semantic Web, business-to-business
applications, and several other application areas. Various research
communities commonly assume that ontologies are the appropriate modeling
structure for representing knowledge. However, little discussion has
occurred regarding the actual range of knowledge an ontology can
successfully represent
The use of colloquial words in advanced French interlanguage
This article addresses the issue of underrepresentation or avoidance of colloquial words in a cross-sectional corpus of advanced French interlanguage (IL) of 29 Dutch L1 speakers and in a longitudinal corpus of 6 Hiberno-Irish English L1 speakers compared with a control of 6 native speakers of French. The main independent variable analysed in the latter corpus is the effect of spending a year in a francophone environment. This analysis is supplemented by a separate study of sociobiographical and psychological factors that affect the use of colloquial vocabulary in the cross-sectional corpus. Colloquial words are not exceptionally complex morphologically and present no specific grammatical difficulties, yet they are very rare in our data. Multivariate regression analyses suggest that only active authentic communication in the target language (TL) predicts the use of colloquial lexemes in the cross-sectional corpus. This result was confirmed in the longitudinal corpus where a t-test showed that the proportion of colloquial lexemes increased significantly after a year abroad
A Domain-Independent Algorithm for Plan Adaptation
The paradigms of transformational planning, case-based planning, and plan
debugging all involve a process known as plan adaptation - modifying or
repairing an old plan so it solves a new problem. In this paper we provide a
domain-independent algorithm for plan adaptation, demonstrate that it is sound,
complete, and systematic, and compare it to other adaptation algorithms in the
literature. Our approach is based on a view of planning as searching a graph of
partial plans. Generative planning starts at the graph's root and moves from
node to node using plan-refinement operators. In planning by adaptation, a
library plan - an arbitrary node in the plan graph - is the starting point for
the search, and the plan-adaptation algorithm can apply both the same
refinement operators available to a generative planner and can also retract
constraints and steps from the plan. Our algorithm's completeness ensures that
the adaptation algorithm will eventually search the entire graph and its
systematicity ensures that it will do so without redundantly searching any
parts of the graph.Comment: See http://www.jair.org/ for any accompanying file
- …