Search results for "Inductive reasoning"
showing 4 items of 54 documents
Using Attribute Grammars for Description of Inductive Inference Search Space
1998
The problem of practically feasible inductive inference of functions or other objects that can be described by means of an attribute grammar is studied in this paper. In our approach based on attribute grammars various kinds of knowledge about the object to be found can be encoded, ranging from usual input/output examples to assumptions about unknown object's syntactic structure to some dynamic object's properties. We present theoretical results as well as describe the architecture of a practical inductive synthesis system based on theoretical findings.
An inductive inference approach to classification
1994
Abstract In this paper we introduce a formal framework for investigating the relationship of inductive inference and the task of classification. We give the first results on the relationship between functions that can be identified in the limit and functions that can be acquired from unclassified objects only. Moreover, we present results on the complexity of classification functions and the preconditions necessary in order to allow the computation of such functions.
La constitucionalidad del razonamiento inductivo
2011
RESUMENParte de las sentencias se basan en razonamientos inductivos, lo que implícitamente nos reconduce a la cuestión del problema de la probabilidad en sede judicial. El Tribunal Constitucional se ha enfrentado en numerosas ocasiones a la tesitura de confrontar la presunción de inocencia con el respeto a la autonomía de la valoración de la prueba por parte de los tribunales. Por ello, ha establecido una serie de requisitos que deben cumplir los razonamientos inductivos para que se consideren constitucionales. El problema que analizamos es que ese canon se basa en arcaísmos, frases hechas y lugares comunes, lo que genera mucha inseguridad en una temática tan susceptible de error, como es l…
On the Amount of Nonconstructivity in Learning Recursive Functions
2011
Nonconstructive proofs are a powerful mechanism in mathematics. Furthermore, nonconstructive computations by various types of machines and automata have been considered by e.g., Karp and Lipton [17] and Freivalds [11]. They allow to regard more complicated algorithms from the viewpoint of much more primitive computational devices. The amount of nonconstructivity is a quantitative characterization of the distance between types of computational devices with respect to solving a specific problem. In the present paper, the amount of nonconstructivity in learning of recursive functions is studied. Different learning types are compared with respect to the amount of nonconstructivity needed to lea…