Search results for "Reason"
showing 10 items of 526 documents
Kolmogorov numberings and minimal identification
1995
Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. To address certain problems in minimal identification for Godel numberings, Freivalds later considered minimal identification in Kolmogorov Numberings. Kolmogorov numberings are in some sense optimal numberings and have some nice properties. We prove certain hierarchy results for minimal identification in every Kolmogorov numbering. In addition we also compare minimal identification in Godel numbering versus minimal identification in Kol…
Parsimony hierarchies for inductive inference
2004
AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…
General inductive inference types based on linearly-ordered sets
1996
In this paper, we reconsider the definitions of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate the possibility of using arbitrary linearly ordered sets to bound mindchanges in a similar way. It turns out that using certain ordered sets it is possible to define inductive inference types more general than the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
Learning with confidence
1996
Herein we investigate learning in the limit where confidence in the current conjecture accrues with time. Confidence levels are given by rational numbers between 0 and 1. The traditional requirement that for learning in the limit is that a device must converge (in the limit) to a correct answer. We further demand that the associated confidence in the answer (monotonically) approach 1 in the limit. In addition to being a more realistic model of learning, our new notion turns out to be a more powerful as well. In addition, we give precise characterizations of the classes of functions that are learnable in our new model(s).
Probability Propagation in Selected Aristotelian Syllogisms
2019
This paper continues our work on a coherence-based probability semantics for Aristotelian syllogisms (Gilio, Pfeifer, and Sanfilippo, 2016; Pfeifer and Sanfilippo, 2018) by studying Figure III under coherence. We interpret the syllogistic sentence types by suitable conditional probability assessments. Since the probabilistic inference of $P|S$ from the premise set ${P|M, S|M}$ is not informative, we add $p(M|(S ee M))>0$ as a probabilistic constraint (i.e., an ``existential import assumption'') to obtain probabilistic informativeness. We show how to propagate the assigned premise probabilities to the conclusion. Thereby, we give a probabilistic meaning to all syllogisms of Figure~III. We…
Transitive Reasoning with Imprecise Probabilities
2015
We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent \(\text{ p-consistent }\) sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Finally, we present the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases.
A Hypergraph Based Framework for Intelligent Tutoring of Algebraic Reasoning
2013
The translation of word problems into equations is one of the major difficulties for students regarding problem solving. This paper describes both a domain-specific knowledge representation and an inference engine based on hypergraphs that permits intelligent student supervision of this stage of the solving process. The framework presented makes it possible to simultaneously: a) represent all potential algebraic solutions to a given word problem; b) keep track of the student’s actions; c) provide automatic remediation; and d) determine the current state of the resolution process univocally. Starting from these ideas, we have designed an intelligent tutoring system (ITS). An experimental eva…
Tratamiento jurídico de una enfermedad social. Los trastornos de la conducta alimentaria (TCA)
2018
The boundless increase of people suffering from an Eating Disorder (ED), makes necessary to develop measures related to other factors, in order to overcome the ones characterized of being strictly sanitary. The disease has become a social and cultural phenomenon. The exaltation of the cult to the body, with the stereotype of the extreme thinness linked with beauty and success is causing that, particularly young people, try to achieve an image which, in many cases, can jeopardize their health, that is the reason why the rearrangement of values has become an objective of paramount importance. Therefore, the fight against this social illness requires legal actions in order to prevent it from g…
Relación entre complejidad y dificultad en tareas con patrones lineales reiterativos en estudiantes de 5 años
2018
Una de las finalidades de la enseñanza de las matemáticas en Educación Infantil es fomentar el pensamiento lógico, la creatividad y la capacidad para resolver problemas de los estudiantes. Entre las actividades escolares propias de estas edades es habitual encontrar tareas de identificación y continuación de patrones lineales de repetición. Esta actividad puede ser estudiada desde un contexto de resolución de problemas en el que el estudiante debe discriminar la información superflua de aquella que le permite obtener la regla de generación de la serie y resolver la tarea. Diferentes variables como la longitud del núcleo de repetición, el número de descriptores, su naturaleza o la aparición …
A multiple criteria decision model for analyzing and choosing among different development patterns for the Helsinki cargo harbor
1999
Abstract This paper describes a real application of a multicriteria approach to choosing among different options for developing the Helsinki harbor. In addition to the environmental impact assessment procedure, an analysis of the alternatives using the SMAA-method (Stochastic Multiobjective Acceptability Analysis) is carried out. The method applied here has been developed for situations in which the use of decision-makers’ preference information is not possible. Instead, the problem is described by typical weight vectors leading to each solution, taking into account the evident uncertainty embedded in the criteria values.