No description available.

No description available.

Title from title page of PDF (University of Missouri--St. Louis, viewed March 22, 2010). Includes bibliographical references.

Propositional attitudes, states like believing, desiring, intending, etc., have played a central role in the articulation of many of our major theories, both in philosophy and the social sciences. Until relatively recently, psychology was a prominent entry on the list of social sciences in which propositional attitudes occupied center stage. In this century, though, behaviorists began to make a self-conscious effort to expunge "mentalistic" notions from their theorizing. Behaviorism has failed. Psychology therefore is again experiencing "formative years," and two themes have caught the interest of philosophers. The first is that psychological theories evidently must exploit a vast array of relations obtaining among internal states. The second is that the use of mentalistic idioms seems to be explicit again in much of current theorizing. These two observations have led philosophers to wonder about the probable as well as the proper role of propositional attitudes in future psychological theories. Some philosophers wonder, in particular, about the role of the contents of propositional attitudes in the forthcoming theories. Their strategy is in part to discern what sorts of theory psychologists now will want to construct, and then discern what role propositional attitude contents might play in theories of those sorts. I consider here two sorts of theory, what I call minimal functional theories and what is known as propositional attitude psychology. I outline these two kinds of theory, and show how each defines a role for contents. Contents are ultimately eliminable in minimal functional theories. Although they play an apparently ineliminable role in propositional attitude psychology, they do so at an apparent cost. Propositional attitude psychology does not seem to accommodate a certain methodological principle, a principle of individualism in psychology, which is endorsed even by some of the philosophers most enamored of the approach. Such philosophers have two options: they can attempt to show that the conflict between the approach and the principle is not genuine, or they can reject the principle. I argue that the conflict is real, and recommend a qualified rejections of the principle.

Thesis (M.Comp.Sci.)--University of Melbourne, Dept. of Computer Science and Software Engineering, 2007. / Typescript. Includes bibliographical references (leaves 109-116).

Thesis (Ph. D.)--University of Washington, 1999. / Vita. Includes bibliographical references (leaves 247-251).

Thesis (Ph. D.)--UCLA, 2010. / Vita. Includes bibliographical references (leaves 178-185).

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 265-272).

Thesis (MSc)--Stellenbosch University , 2002. / ENGLISH ABSTRACT: Grammars with regulated rewriting are used to restrict the application of contextfree productions in order to avoid certain derivations. This enables these grammars to generate both context-free and non-context-free languages using only production rules with a context-free format. These grammars are more powerful than contextfree grammars, but usually not as powerful as context-sensitive grammars. Various grammars with regulated rewriting have been developed and some will be discussed in this thesis. Propositional linear temporal logic is a formal system used to describe truth values of propositions over time. This is done by defining a timeline together with a set of propositions. It is then possible to construct temporal logic formulae, consisting of these propositions and temporal operators, to specify the truth values of the propositions for every step in the timeline. In this thesis we define and discuss temporal grammars that combine grammars with propositionallinear temporal logic. Since a derivation can be associated with a timeline, a regulating device can be constructed from temporal logic formulae, that will control the application of productions within the derivation. The discussion on temporal grammars includes some of the properties of these grammars, while many ideas are illustrated by examples. / AFRIKAANSE OPSOMMING: Grammatikas met gereguleerde herskrywing word gebruik om 'n beperking te plaas op die toepassing van konteksvrye produksies en verhoed sodoende sekere afleidings. Hierdie grammatikas beskik oor die vermoe om beide konteksvrye en nie-konteksvrye tale te genereer deur slegs produksiereels van 'n konteksvrye formaat te gebruik. Grammatikas met gereguleerde herskrywing is dus sterker as konteksvrye grammatikas, alhoewel dit soms swakker as konteks-sensitiewe grammatikas is. 'n Verskeidenheid sulke grammatikas is al ontwikkel en sommige sal in hierdie tesis bespreek word. Proposisionele lineere temporale logika is 'n formele stelsel wat gebruik kan word om die waarheidswaardes van proposisies oor tyd te beskryf. Dit word gedoen deur 'n tydlyn, asook 'n versameling proposisies te definieer. Dit is clan moontlik om temporale operatore tesame met die proposisies te gebruik om temporale logika-formules te konstrueer wat in staat is om waarheidswaardes van die proposisies te spesifiseer vir elke oomblik in die tydlyn. In hierdie tesis word temporale grammatikas, wat grammatikas met proposisionele lineere temporale logika kombineer, gedefinieer en bespreek. Aangesien 'n afleiding met 'n tydlyn geassosieer kan word, is dit moontlik om 'n regulerende meganisme uit temporale logika-formules te konstrueer wat die toepassing van produksiereels in die afleiding kontroleer. Die bespreking van temporale grammatikas sluit 'n verskeidenheid eienskappe van die grammatikas in, asook 'n aantal voorbeelde wat ter illustrasie gebruik word.

Orientadores: Wagner Caradori do Amaral, Paulo Augusto Valente Ferreira / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-06T08:06:48Z (GMT). No. of bitstreams: 1 Moreira_VicenteDelgado_D.pdf: 1111607 bytes, checksum: 9222971b25851f421024465a31aedb3b (MD5) Previous issue date: 2006 / Resumo: O interesse pelo projeto de controladores preditivos para sistemas híbridos vem aumentando nos últimos anos. Os sistemas híbridos são descritos simultaneamente por relações lógicas, baseadas por exemplo nos operadores SE/ENTÃO/SENÃO, e por equações dinâmicas. Devido às exigências relacionadas ao desempenho de rastreio das referências em malha fechada, busca-se atualmente metodologias de modelagem que permitam integrar as representações dinâmicas e as proposições lógicas do processo híbrido em uma abordagem não-hierárquica. As abordagens encontradas na literatura para o controle preditivo de sistemas híbridos são preferencialmente aplicáveis a processos determinísticos cujas dinâmicas são representadas no espaço de estados. Em certos casos, um modelo de estados não é conhecido, incertezas para métricas politópicas inviabilizam o projeto de controladores preditivos robustos, ou outras formas de modelagem são mais adequadas para a representação do processo. Neste trabalho, desenvolve-se uma nova metodologia para a modelagem e o controle preditivo robusto de sistemas híbridos incertos. Na abordagem proposta, as proposições lógicas são transformadas em desigualdades lineares mistas equivalentes, como sugerido na literatura. Um modelo baseado em séries de funções ortonormais é estimado para descrever o comportamento dinâmico do processo. Os modelos baseados em séries podem ser representados no espaço de estados, e a ordem do modelo pode ser reduzida escolhendo-se adequadamente as bases ortonormais. Como sugerido na literatura, a incerteza de um conjunto de respostas ao impulso é mapeada em intervalos de pertinência que definem os coeficientes da série ortonormal. Impõe-se condições adicionais sobre esta técnica para assegurar que todas as respostas ao impulso do processo estão representadas no modelo. Os limites da incerteza são estimados, ao contrário das abordagens encontradas na literatura, onde é necessário conhecer antecipadamente a amplitude máxima da perturbação. A equação de estados do modelo proposto não contém coeficientes incertos, implicando que o seu espaço politópico é reduzido substancialmente quando comparado às abordagens existentes na literatura, onde todas as matrizes da representação de estados podem estar contidas em politopos. Também propõe se uma nova estratégia para assegurar a estabilidade robusta do processo em malha fechada com controle preditivo. A estratégia é baseada em conjuntos terminais, uma das formas menos conservadoras de assegurar o rastreio das referências do sistema. Resultados de simulação são apresentados para ilustrar o desempenho desta nova abordagem de controle preditivo robusto para sistemas híbridos incertos. Utiliza-se o algoritmo proposto para o controle de um sistema de refrigeração industrial / Abstract: Model-based Predictive Control (MPC) has been attracting interest in both academic and industrial areas since the 1970's. The MPC methodology has been recently extended to a class of hybrid systems described by dynamics and logic rules. Logical propositions are performed by using, for example, IF /THEN/ELSE operators. Due to performance requirements, the nonhierarchical modeling approaches to hybrid systems have been preferable in MPC schemes. Some methodologies to the modeling and predictive controling of hybrid systems can be found in the literature. These schemes are specially applicable to deterministic hybrid systems whose dynamics are represented in state-space. In some cases, a state-space model is not available or politopic uncertainties can prohibit real time implementations. Over this, other models can be more adequate to parameter estimation. A new approach for modeling and controlling a class of hybrid systems described by interacting physical laws, logic rules, and operational requirements is proposed in this work. As recently suggested in the literature, the logic rules are integrated into the model as equivalent linear inequality constraints involving both continuous and binary variables. The distinguishing feature of the approach proposed is the use of orthonormal series for modeling the process dynamics. The model proposed can be easily estimated with only approximate knowledge of the system dynamics. The order of the model can be reduced by an adequate selection of the orthonormal basis. Uncertainties in the process dynamics are incorporated into the output equation only, reducing the mo dei politopic space. A new strategy to assure robust stability is also presented. The reference tracking is guaranteed by using a terminal set constraint, which does not severally affect the tracking performance of the closed loop system. The approaches proposed in the literature to determine a terminal set constraint use the maximal amplitude of the perturbation,which is generally unknown.- 15 this work, the limits of the uncertainty are estimated. Simulation examples illustrate the main characteristics of the framework proposed. / Doutorado / Automação / Doutor em Engenharia Elétrica