Search results for "Reasoning"
showing 10 items of 371 documents
On the intrinsic complexity of learning
1995
A new view of learning is presented. The basis of this view is a natural notion of reduction. We prove completeness and relative difficulty results. An infinite hierarchy of intrinsically more and more difficult to learn concepts is presented. Our results indicate that the complexity notion captured by our new notion of reduction differs dramatically from the traditional studies of the complexity of the algorithms performing learning tasks.
Was King Arthur a King by Definition?
1988
Current research in knowledge representation distinguishes between descriptional and assertional interpretations of semantic nets. This paper explores theoretical and applicative problems, which arise from that distinction in a historic domain. A prolog implementation of KL-ONE is used as a vehicle to compare the various alternatives available to represent knowledge related to single elements of the domain insertion or not of this knowledge in semantic nets in their descriptional sense. The final section of the paper discusses the problem in relation to the theories concerning the functioning of proper names from a logical and philosophical point of view.
A Knowledge-Based System for the Automatic Generation of Plant Shutdown and Startup Schedules
1988
Abstract When the shutdown of a plant, or part of it, has been decided as consequence of a major fault, the generation of a safe shutdown schedule may be, for large and complex plants, a very difficult and delicate task. The same problem may be found when the plant must be restarted after the fault has been repaired, for the generation of a start-up schedule. The use of a knowledge-based system appears to be a suitable answer to this problem, allowing a high level of safety and a very fast generation process. The paper examines the process knowledge that needs to be included in such a knowledge-based system and proposes some knowledge representation forms that appear suitable for the task t…
Discretized Bayesian Pursuit – A New Scheme for Reinforcement Learning
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_79 The success of Learning Automata (LA)-based estimator algorithms over the classical, Linear Reward-Inaction ( L RI )-like schemes, can be explained by their ability to pursue the actions with the highest reward probability estimates. Without access to reward probability estimates, it makes sense for schemes like the L RI to first make large exploring steps, and then to gradually turn exploration into exploitation by making progressively smaller learning steps. However, this behavior becomes counter-intuitive wh…
Analogical reasoning performance and organization is influenced by the type of semantic distractors : an investigation with adults
2015
International audience; The way participants adapt their search to the specifics of different types of analogies is not fully understood. We compared the effects of two types of semantic distractors. The first were related to C by a semantic relation which had nothing to do with the semantic relation used in the A:B pairs, whereas the second, the so-called "double distractors", were not only related to C but also had a semantic relation similar to the one linking A to B. We used eye-tracking measurements in addition to reaction time and performance indices. We found that performance decreased, and that the solution set was less explored visually with the double distractors than with the for…
ViziQuer: A Web-Based Tool for Visual Diagrammatic Queries Over RDF Data
2018
We demonstrate the open source ViziQuer tool for web-based creation and execution of visual diagrammatic queries over RDF/SPARQL data. The tool supports the data instance level and statistics queries, providing visual counterparts for most of SPARQL 1.1 select query constructs, including aggregation and subqueries. A query environment can be created over a user-supplied SPARQL endpoint with known data schema (a data schema exploration service is available, as well). There are pre-defined demonstration query environments for a mini-university data set, a fragment of synthetic similar to reality hospital data set, and a variant of Linked Movie Database RDF data set.
A Multimodal Guide for the Augmented Campus
2007
The use of Personal Digital Assistants (PDAs) with ad-hoc built-in information retrieval and auto-localization functionalities can help people navigating an environment in a more natural manner compared to traditional audio/visual pre-recorded guides. In this work we propose and discuss a user-friendly, multi-modal guide system for pervasive context-aware service provision within augmented environments. The proposed system is adaptable to the user needs of mobility within a given environment; it is usable on different mobile devices and in particular on PDAs, which are used as advanced adaptive HEI (human-environment interaction) interfaces. An information retrieval service is provided that…
Closedness Properties in EX-Identification of Recursive Functions
1998
In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n - 1 classes out of U1;, . . ., Un is identifiable, so is the union of all n classes; 2) there are such classes U1;, . . ., Un-1 that every union of n-2 classes out of them is identifiable, while the union of n - 1 classes is not. We show that by finding these n we can distinguish which requirements put on the iden…
Unions of identifiable families of languages
1996
This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identification types are not closed under the set union, some of them still have features that resemble closedness. To formalize this, we generalize the notion of closedness. Then by establishing “how closed” these identification types are we solve the satisfiability problem.
Shall We (Math and) Dance?
2019
Can we use mathematics, and in particular the abstract branch of category theory, to describe some basics of dance, and to highlight structural similarities between music and dance? We first summarize recent studies between mathematics and dance, and between music and categories. Then, we extend this formalism and diagrammatic thinking style to dance.