In this thesis, I argue that at least some animals have the sort of intentionality philosophers traditionally have only ascribed to humans. I argue for this through the examination of tool-use among New Caledonian crows and Bottlenose dolphins. New Caledonian crows demonstrate advanced tool-manufacture and standardization, while Bottlenose dolphins use social learning to a much greater degree than other animals. These two case studies fit nicely with many of the non-linguistic accounts of intentionality employed by philosophers. This thesis is aimed at showing that our basic philosophical concept of intentionality leaves room for intentional behavior on the part of non-human animals. Descriptions of human behavior are often contrasted with that of "lower" animals. Many have taken rationality as the characteristic that separates us from animals, and our notions about the superiority of humans have been passed down through theology and philosophy. From Plato onward, philosophers have created divisions that put humanity in a special position relative to all other creatures. Neglecting a careful analysis of animal behavior in making these divisions does a disservice not only to the animals themselves, but also to humans. This thesis is an attempt to start pulling a thread of the discussion about the specialness of humans out for examination. Specifically, I examine the case of intentionality in the framework of the tool-related behaviors of crows and dolphins. / Master of Arts

Errors in collections of data can cause significant problems when those data are used. Therefore the owners of data find themselves spending much time on data cleaning. This thesis is a theoretical work about one part of the broad subject of data cleaning - to be called the covering set method. More specifically, the covering set method deals with data records that have been assessed by the use of edits, which are rules that the data records are supposed to obey. The problem solved by the covering set method is the error localisation problem, which is the problem of determining the erroneous fields within data records that fail the edits. In this thesis I analyse the covering set method from the perspective of propositional logic. I demonstrate that the covering set method has strong parallels with well-known parts of propositional logic. The first aspect of the covering set method that I analyse is the edit generation function, which is the main function used in the covering set method. I demonstrate that the edit generation function can be formalised as a logical deduction function in propositional logic. I also demonstrate that the best-known edit generation function, written here as FH (standing for Fellegi-Holt), is essentially the same as propositional resolution deduction. Since there are many automated implementations of propositional resolution, the equivalence of FH with propositional resolution gives some hope that the covering set method might be implementable with automated logic tools. However, before any implementation, the other main aspect of the covering set method must also be formalised in terms of logic. This other aspect, to be called covering set correctibility, is the property that must be obeyed by the edit generation function if the covering set method is to successfully solve the error localisation problem. In this thesis I demonstrate that covering set correctibility is a strengthening of the well-known logical properties of soundness and refutation completeness. What is more, the proofs of the covering set correctibility of FH and of the soundness / completeness of resolution deduction have strong parallels: while the proof of soundness / completeness depends on the reduction property for counter-examples, the proof of covering set correctibility depends on the related lifting property. In this thesis I also use the lifting property to prove the covering set correctibility of the function defined by the Field Code Forest Algorithm. In so doing, I prove that the Field Code Forest Algorithm, whose correctness has been questioned, is indeed correct. The results about edit generation functions and covering set correctibility apply to both categorical edits (edits about discrete data) and arithmetic edits (edits expressible as linear inequalities). Thus this thesis gives the beginnings of a theoretical logical framework for error localisation, which might give new insights to the problem. In addition, the new insights will help develop new tools using automated logic tools. What is more, the strong parallels between the covering set method and aspects of logic are of aesthetic appeal.

Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are represented in ASP by sets of atoms, and not by substitutions, as in Prolog. Answer set systems, such as Smodels, Smodelscc, and DLV, compute answer sets of a given program in the sense of the answer set (stable model) semantics. This is different from the functionality of Prolog systems, which determine when a given query is true relative to a given logic program. ASP has been applied to many areas of science and technology, from the design of a decision support system for the Space Shuttle to graph-theoretic problems arising in zoology and linguistics. The "native" answer set systems mentioned above are based on specialized search procedures. Usually these procedures are described fairly informally with the use of pseudocode. We propose an alternative approach to describing algorithms of answer set solvers. In this approach we specify what "states of computation" are, and which transitions between states are allowed. In this way, we define a directed graph such that every execution of a procedure corresponds to a path in this graph. This allows us to model algorithms of answer set solvers by a mathematically simple and elegant object, graph, rather than a collection of pseudocode statements. We use this abstract framework to describe and prove the correctness of the answer set solver Smodels, and also of Smodelscc, which enhances the former using learning and backjumping techniques. Answer sets of a tight program can be found by running a SAT solver on the program's completion, because for such a program answer sets are in a one-to-one correspondence with models of completion. SAT is one of the most widely studied problems in computational logic, and many efficient SAT procedures were developed over the last decade. Using SAT solvers for computing answer sets allows us to take advantage of the advances in the SAT area. For a nontight program it is still the case that each answer set corresponds to a model of program's completion but not vice versa. We show how to modify the search method typically used in SAT solvers to allow testing models of completion and employ learning to utilize testing information to guide the search. We develop a new SAT-based answer set solver, called Cmodels, based on this idea. We develop an abstract graph based framework for describing SAT-based answer set solvers and use it to represent the Cmodels algorithm and to demonstrate its correctness. Such representations allow us to better understand similarities and differences between native and SAT-based answer set solvers. We formally compare the Smodels algorithm with a variant of the Cmodels algorithm without learning. Abstract frameworks for describing native and SAT-based answer set solvers facilitate the development of new systems. We propose and implement the answer set solver called SUP that can be seen as a combination of computational ideas behind Cmodels and Smodels. Like Cmodels, solver SUP operates by computing a sequence of models of completion of the given program, but it does not form the completion. Instead, SUP runs the Atleast algorithm, one of the main building blocks of the Smodels procedure. Both systems Cmodels and SUP, developed in this dissertation, proved to be competitive answer set programming systems. / text

Introduction: There remains a lack of theoretical models which can adequately account for the key features of bipolar disorders (Power, 2005). Objectives: Firstly, to test the predictions made by the SPAARS model that mania is predominantly characterised by the coupling of happiness with anger, while depression (unipolar and bipolar) primarily comprises of a coupling between sadness and disgust. Secondly, to investigate and compare the coping strategies employed to regulate positive and negative emotion between bipolar, unipolar and control groups. Design: A cross sectional design was employed to examine the differences within and between the bipolar, unipolar and control groups in the emotions experienced and the strategies used to regulate emotion. Data were analysed using ANOVAs. Method: Psychiatric diagnoses in the clinical groups were confirmed using the SCID. Current mood state was measured using the BDI-II, STAI and the MAS. The Basic Emotion Scale was used to explore the emotional profiles and the Regulation of Emotion Questionnaire was used to measure coping strategies. Results: The results confirmed the predictions made by the SPAARS model about the emotions in mania and depression. Elevated levels of disgust were also found in the bipolar group generally. The clinical groups used internal dysfunctional strategies more often than the controls for negative emotion. The bipolar group used external dysfunctional strategies more frequently than the controls for positive emotion. Conclusion: The results support the predictions made by the SPAARS model and suggest that disgust plays a key role in bipolar disorder. Strengths and limitations are discussed and suggestions for future research are explored.

[pt] O objetivo deste trabalho é o de investigar a assimetria estrutural e constitutiva entre fatos e proposições, segundo diferentes graus de determinação, que nos conduzem à hipótese de proposições verdadeiras como propriedades de fatos ou do mundo, com consequências semânticas, metafísicas e epistêmicas. Do ponto de vista semântico, partimos da classificação de Russell entre sentido e denotação das sentenças linguísticas, para aplicá-la às proposições empíricas ou contingentes, em sua relação com os complexos fatos que as tornam verdadeiras, em defesa de uma teoria realista da verdade. Do ponto de vista metafísico, analisamos a natureza dos fatos e proposições, como complexos estruturados e unificados, cuja diferença de constituição corrobora a hipótese de que proposições abstraem aspectos parciais de fatos concretos. A complexidade geral dos fatos, eventos ou situações, com fronteiras espaciotemporais vagamente delimitadas, conduz-nos a uma comparação entre as relações de truthmaking e causalidade, que será útil para o desenvolvimento de nossa hipótese, a ser aprofundada por meio de uma análise da noção de propriedade particularizada ou trope. E do ponto de vista epistêmico, investigamos em que medida proposições abstratas são propriedades identificadoras de fatos concretos, bem como de que modo podemos conhecê-los, a partir da distinção russelliana entre conhecimento direto e indireto. / [en] The aim of this study is to investigate the structural and constitutive asymmetry between facts and propositions, subject to different degrees of determination, which lead us to the hypothesis of true propositions as properties of facts or of the world, with semantic, metaphysical and epistemic consequences. From the semantic point of view, we start from the classification of Russell between sense and denotation of linguistic sentences, to apply it to the empirical or contingent propositions, in its relationship with the complex facts that make them true, in defense of a realist theory of truth. From the metaphysical point of view, we analyze the nature of facts and propositions, as structured and unified complexes, whose difference of constitution supports the hypothesis that propositions abstract partial aspects of concrete facts. The overall complexity of the facts, events or situations, with faintly delimited spatiotemporal boundaries, leads us to a comparison between the relations of truthmaking and causality, which will be useful for developing our hypothesis, to be discussed further through an analysis of the notion of a particularized property or trope. And from the epistemic point of view, we investigate to what extent are abstract propositions identifying properties of concrete facts, and how can we know them, by assuming the Russellian distinction between direct and indirect knowledge.

O ponto central dessa dissertação é expor categorialmente as funções de verdade do cálculo proposicional clássico, assim como provar, também categorialmente, que a definição dada se comporta tal como as tabelas de verdade dos operadores. Para tanto é feita uma exposição axiomática de teoria de categorias, salientando as construções e conceitos que servirão para o propósito principal da dissertação. É dada uma maior atenção ao conceito de Topos, estrutura onde as funções de verdade são em princípio construídas. Tal exposição é precedida de uma breve exposição da história de teoria de categorias. Por fim é apresentada uma possível nova estrutra, mais simples que Topos, onde também se constrói as funções de verdade. / The main purpose of this dissertation is to give a categorial account of the truth functions from the classic propositional calculus, as well as to prove, also categorially, that the definition given behave as the truth tables of the operators. For this end, an axiomatic exposition of category theory is made, focusing on constructions and concepts which will be used for the main purpose of the dissertation. More attention is given to the concept of Topos, structure where the truth functions are primarily constructed. Preceded by a brief exposition of Category Theory history. At the end, a new possible structure in which truth functions may be constructed, simpler than a Topos, is presented.

Apresentamos alguns aspectos da teoria de funções modais, que é o correlato modal da teoria de funções de verdade. Enquanto as fórmulas da lógica proposicional clássica expressam funções de verdade, as fórmulas da lógica proposicional modal (S5) expressam funções modais. Generalizamos alguns dos teoremas da teoria de funções de verdade para o caso modal; em particular, exibimos provas da completude funcional de alguns conjuntos de funções modais e definimos uma (nova) noção de reduto vero-funcional de funções modais, bem como a composição de funções modais em termos destes redutos. / We present some aspects of the theory of modal functions, which is the modal correlate of the theory of truth-functions. While the formulas of classical propositional logic express truth-functions, the formulas of modal propositional logic (S5) express modal functions. We generalize some theorems of the theory of truth-functions to the modal case; in particular, we show the functional completeness of some sets of modal functions and define a (new) notion of truth-functional reduct of modal functions, as well as the composition of modal functions in terms of such reducts.

Submitted by Silvana Teresinha Dornelles Studzinski (sstudzinski) on 2015-06-26T15:38:20Z No. of bitstreams: 1 ElisangelaPereiraMachado.pdf: 508733 bytes, checksum: 16b694421a5479123a135d970587af3a (MD5) / Made available in DSpace on 2015-06-26T15:38:20Z (GMT). No. of bitstreams: 1 ElisangelaPereiraMachado.pdf: 508733 bytes, checksum: 16b694421a5479123a135d970587af3a (MD5) Previous issue date: 2011 / Milton Valente / O propósito deste estudo é examinar o conceito, intencionalmente ambíguo, de transcendência na imanência, presente na obra Egocentricidade e Mística de Ernst Tugendhat. Quer-se mediante o estudo de sua filosofia tardia uma resposta para a questão sobre que aspecto da vida humana está na base da procura pela religião e que tem conduzido os seres humanos a uma mística. A pedra de toque desta investigação está na análise da estrutura predicativa da linguagem, apresentada pelo autor como sendo elemento fundamental para a caracterização do específicamente humano. A linguagem do homem o diferencia de todos os demais animais e o joga no espaço da deliberação, por conseguinte, numa situação de indecisão e desejo de paz de espírito. Dada a estrutura predicativa da linguagem humana somos capazes de nos distanciar dos objetos, situações em que devemos agir e até de nós mesmos - nossas intenções-, somos então levados à duvida tanto sobre o que somos quanto sobre o que devemos ser. A linguagem predicativa e o consequente pensamento instrumental, abre espaço para a deliberação, distanciando o homem de seu modo de vida e o levando a perguntar por razões para permanecer nele. Tugendhat aponta para a deliberação enquanto orientação para uma escala de valores, escolhas não mais pautada pelo prazer ou pelas inclinações, ou seja, caminho para uma mística a qual o filósofo irá apresentar mediante uma perspectiva imanente. Na primeira metade deste trabalho apresento a base antropológica para a mística tal como a concebe Tugendhat. Na segunda metade discuto, sempre acompanhando o autor, a morte como caminho para a mística e, a partir da diferença entre mística e religião, algumas místicas orientais, em especial o taoísmo. / The purpose of this study is to examine the intentionally ambiguous concept of transcendence in the immanent, present in the work of Ernst Tugendhat Egocentricidy and Mystic. Whether is through the study of his later philosophy a response more satisfactory reply to the question of the aspect of human life which is the base for the search for religion and which has ledman to the mystic. The touchstone of this investigation is in the analysis of the predicative structure of the language, presented by the author as being a basic element for the characterization of a specific one of the human being. The language of man differentiates from all other animal languages which puts it in the space of deliberation, therefore, in a situation of indetermination and desire for spiritual peace. Given the predicative structure of human language, we are capable of distancing ourselves from objects and situations in which we must act and of even ourselves – our intentions – we are then led to doubts about who or what we are, as well as what we must be. Predicative language and the consequent instrumental thought, open space for deliberation, distancing man from his way of life and leading him to question reasons for remaining in it. Tugendhat points to deliberation with regard to orientation, for a scale of values, choices no longer guided by pleasure or inclination, that is, a way for a mystic which the philosopher will present by means of the immanent perspective. In the first half of this dissertation I present the anthropological basis for the mystic as it is conceived by Tugendhat. In the second half I discuss, following the author's path, death as a way for the mystic and, starting from the difference between mysticism and religion, some eastern mystical traditions, especially Taoism.

The propositional satisfiability (SAT) problem is of considerable theoretical and practical relevance to the artificial intelligence (AI) community and has been used to model many pervasive AI tasks such as default reasoning, diagnosis, planning, image interpretation, and constraint satisfaction. Computational methods for SAT have historically fallen into two broad categories: complete search and local search. Within the local search category, clause weighting methods are amongst the best alternatives for SAT, becoming particularly attractive on problems where a complete search is impractical or where there is a need to find good candidate solutions within a short time. The thesis is concerned with the study of improvements to clause weighting local search methods for SAT. The main contributions are: A component-based framework for the functional analysis of local search methods. A clause weighting local search heuristic that exploits longer-term memory arising from clause weight manipulations. The approach first learns which clauses are globally hardest to satisfy and then uses this information to treat these clauses differentially during weight manipulation [Ferreira Jr and Thornton, 2004]. A study of heuristic tie breaking in the domain of additive clause weighting local search methods, and the introduction of a competitive method that uses heuristic tie breaking instead of the random tie breaking approach used in most existing methods [Ferreira Jr and Thornton, 2005]. An evaluation of backbone guidance for clause weighting local search, and the introduction of backbone guidance to three state-of-the-art clause weighting local search methods [Ferreira Jr, 2006]. A new clause weighting local search method for SAT that successfully exploits synergies between the longer-term memory and tie breaking heuristics developed in the thesis to significantly improve on the performance of current state-of-the-art local search methods for SAT-encoded instances containing identifiable CSP structure. Portions of this thesis have appeared in the following refereed publications: Longer-term memory in clause weighting local search for SAT. In Proceedings of the 17th Australian Joint Conference on Artificial Intelligence, volume 3339 of Lecture Notes in Artificial Intelligence, pages 730-741, Cairns, Australia, 2004. Tie breaking in clause weighting local search for SAT. In Proceedings of the 18th Australian Joint Conference on Artificial Intelligence, volume 3809 of Lecture Notes in Artificial Intelligence, pages 70–81, Sydney, Australia, 2005. Backbone guided dynamic local search for propositional satisfiability. In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics, AI&M, Fort Lauderdale, Florida, 2006.

Recent research has shown that it is often preferable to encode real-world problems as propositional satisfiability (SAT) problems and then solve using a general purpose SAT solver. However, much of the valuable information and structure of these realistic problems is flattened out and hidden inside the corresponding Conjunctive Normal Form (CNF) encodings of the SAT domain. Recently, systematic SAT solvers have been progressively improved and are now able to solve many highly structured practical problems containing millions of clauses. In contrast, state-of-the-art Stochastic Local Search (SLS) solvers still have difficulty in solving structured problems, apparently because they are unable to exploit hidden structure as well as the systematic solvers. In this thesis, we study and evaluate different ways to effectively recognise, model and efficiently exploit useful structures hidden in realistic problems. A summary of the main contributions is as follows: 1. We first investigate an off-line processing phase that applies resolution-based pre-processors to input formulas before running SLS solvers on these problems. We report an extensive empirical examination of the impact of SAT pre-processing on the performance of contemporary SLS techniques. It emerges that while all the solvers examined do indeed benefit from pre-processing, the effects of different pre-processors are far from uniform across solvers and across problems. Our results suggest that SLS solvers need to be equipped with multiple pre-processors if they are ever to match the performance of systematic solvers on highly structured problems. [Part of this study was published at the AAAI-05 conference]. 2. We then look at potential approaches to bridging the gap between SAT and constraint satisfaction problem (CSP) formalisms. One approach has been to develop a many-valued SAT formalism (MV-SAT) as an intermediate paradigm between SAT and CSP, and then to translate existing highly efficient SAT solvers to the MV-SAT domain. In this study, we follow a different route, developing SAT solvers that can automatically recognise CSP structure hidden in SAT encodings. This allows us to look more closely at how constraint weighting can be implemented in the SAT and CSP domains. Our experimental results show that a SAT-based mechanism to handle weights, together with a CSP-based method to instantiate variables, is superior to other combinations of SAT and CSP-based approaches. In addition, SLS solvers based on this many-valued weighting approach outperform other existing approaches to handle many-valued CSP structures. [Part of this study was published at the AAAI-05 conference]. 3. Finally, we propose and evaluate six different schemes to encode temporal reasoning problems, in particular the Interval Algebra (IA) networks, into SAT CNF formulas. We then empirically examine the performance of local search as well as systematic solvers on the new temporal SAT representations, in comparison with solvers that operate on native IA representations. Our empirical results show that zChaff (a state-of-the-art complete SAT solver) together with the best IA-to-SAT encoding scheme, can solve temporal problems significantly faster than existing IA solvers working on the equivalent native IA networks. [Part of this study was published at the CP-05 workshop].