Thesis (Ph. D.)--Illinois State University, 2001. / Title from title page screen, viewed April 25, 2006. Dissertation Committee: Cynthia W. Langrall (Chair), Graham A. Jones, Tami S. Martin, Patricia H. Klass. Includes bibliographical references (leaves 138-146) and abstract. Also available in print.

Orientador: Marcelo Esteban Coniglio / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas / Made available in DSpace on 2018-08-10T04:02:35Z (GMT). No. of bitstreams: 1 BatistaNeto_AlbertoLeopoldo_M.pdf: 764702 bytes, checksum: 38e943aef1a6e4a5f892916208eca7a5 (MD5) Previous issue date: 2007 / Resumo: Visando a atingir um esclarecimento sobre os conceitos fundamentais envolvidos no estudo das combinações entre lógicas, empreendemos uma alise do problema da representação geral de sistemas lógicos (com ênfase no conceito central de conseqüência lógica), juntamente com o do estabelecimento de uma noção apropriada de tradução ou morfismo entre os sistemas definidos de um determinado modo, com base em que podemos fundamentar algumas técnicas de combinação, especialmente a fibrilação algébrica. Tais técnicas são definidas e apresentadas em suas propriedades mais relevantes, sendo encontrados, no caso particular da fibrilação, problemas tais como o colapso e o anti-colapso. Para estes, a solução parece residir na escolha de formas adequadas de representar lógicas em geral e de traduzir lógicas umas nas outras. Uma apresentação modelo-teorética mostra-se apropriada para algumas representações de lógicas em geral (como, por exemplo, sistemas de Hilbert), embora não o seja para outras (como sistemas de conseqüências múltiplas). No entanto, duas das mais promissoras tentativas de solucionar, em particular, o problema do anti-colapso da fibrilação algébrica as meta-traduções e os transfers elementares podem ser definidas dentro desse arcabouço. Os transfers incluindo os transfers elementares - foram definidos em [17] - e aqui apresentamos uma representação das meta-traduções como tipo específico de transfer / Abstract: In order to accomplish an elucidation of the fundamental concepts involved in the study of the combinations between logics, we undertake an analysis of the problem of the general representation of logical systems (with an emphasis on the central concept of logical consequence) together with that of the establishment of an appropriate notion of translation or morphism between the logical systems defined in a certain fashion, on which basis we can ground some of the combination techniques, specially that of algebraic fibring. Such techniques are defined and presented in their most relevant features, and we find, in the particular case of fibring, problems such as collapsing and anticollapsing. The solution for these seem to rest on the choice of adequate forms of representing logics in general and translating logics into others. A modeltheoretic presentation shows itself appropriate for some representations of logics in general (such as Hilbert calculi), although they are not for some others (such as multipleconclusion systems). Notwithstanding, two of the most promising attempts to solve, in particular, the problem of the anticollapsing of algebraic fibring metatranslations and elementary transfers , are definable within that framework. Transfers including elementary transfers have been defined in [17] and we here present a representation of metatranslations as an specific kind of transfers / Mestrado / Logica / Mestre em Filosofia

M.Ed. / Please refer to full text to view abstract

No description available.

When representing statements about knowledge in an extensional logic, it occasionally happens that undesired conclusions arise. Such extraneous conclusions are often the result of substitution of equals for equals or existential instantiation within intensional operators such as Know. In the past, efforts at solving this problem have centered on modifications to the logic. In this thesis, I propose a solution that leaves the logic intact and changes the representation of the statements instead. The solution presented here has four main points: 1) Only propositions can be known. 2) Relations rather than functions should be used to describe objects. 3) Temporal reasoning is often necessary to represent many real world problems. 4) In cases where more than one label can apply to the same object, an agent's knowledge about labels must be explicitly represented. When these guidelines are followed, statements about knowledge can be represented in standard first-order predicate logic in such a way that extraneous conclusions cannot be drawn. Standard first-order theorem provers (like Prolog) can then be used to solve problems which involve reasoning about knowledge / M.S.

Call number: LD2668 .T4 1985 J63 / Master of Science

This study investigated the effect of an eight-step cognitive strategy on verbal math problem solving performance of six learning disabled adolescents. The research was conducted in an applied setting by the investigator, the students' learning disabilities teacher. The cognitive strategy was designed to enable students to read, understand, carry out, and check verbal math problems that are encountered in the general math curriculum at the secondary level. A multiple baseline across individuals design permitted demonstration of the effectiveness of the strategy. Conditions of the experiment included baseline, treatment, generalization, maintenance, and, for two students, retraining. During treatment, students received strategy acquisition training over three sessions. When the students demonstrated verbalization of the eight strategy steps from memory, strategy application practice and testing commenced. Utilization of the strategy and improved performance were measured by scores on tests of two-step verbal math problems. The number of correct responses and the number of minutes taken to complete each test were recorded on graphs. Visual analysis of the data indicated that this eight-step cognitive strategy appeared to be an effective intervention for this sample of students who had deficits in verbal math problem solving. Overall, the students demonstrated improved performance on two-step verbal math problems with four of the six students generalizing the use of the strategy to three-step problems. Four students maintained improved performance over a two-week lapse in instruction and practice. Substantial increases were noted for the amount of time required to complete the verbal math problem solving tests immediately following strategy acquisition training. Completion time rapidly stabilized to an acceptable level. This study has implications for an alternative teaching methodology that focuses on cognitive strategy training to improve verbal math problem solving for learning disabled youngsters. Future research could offer evidence of the applicability of cognitive strategy training to other populations and further delineate the characteristics of students who do and do not benefit from cognitive strategy intervention.

This research establishes the feasibility and potential utility of a software mechanism which employs artificial intelligence techniques to enhance the capabilities of standard discrete event simulators. As background, current methods of integrating artificial intelligence with simulation and relevant research are briefly reviewed.

Call number: LD2668 .T4 1986 J37 / Master of Science / Computing and Information Sciences

Orientador: Renata Zotin Gomes de Oliveira / Banca: Elaine Cristina Catapani Poletti / Banca: Wladimir Seixas / Resumo: Neste traboalho são apresentados alguns conceitos básicos da Teoria de Conjuntos Fuzzy como: operações comu conjunto fuzzy, Princípio de Extensão de Zadeh, números fuzzy e noçoes de lógica fuzzy. As relações são apresentadas com o objetivo de tratarmos de sistemas baseados em regras fuzzy e algumas aplicações / Abstract: In this paper are presented some basic concepts of Fuzzy Sets Theory: operation with fuzzy sets, Zadeh extension principle, fuzzy numbers and fuzzy logic. The fuzzy relations are presented for the purpose of treating systems based on fuzzy rules and some application / Mestre