Numeralklassifikatoren im Thai

Wie viele andere Sprachen Ost- und Südostasiens ist das Thai eine numerusneutrale Sprache, in der ein Nomen lediglich das Konzept benennt und keinen Hinweis auf die Anzahl der Objekte liefert. Um Nomina im Thai zählen zu können, ist der Klassifikator (Klf) nötig, der die Objekte anhand ihrer semantischen Schlüsseleigenschaft herausgreift und individualisiert. Neben der Klassifikation stellt die Individualisierung die Hauptfunktion des Klf dar. Weitere Kernfunktionen des Klf außerhalb des Zählkontextes sind die Markierung der Definitheit, des Numerus sowie des Kontrasts. Die wichtigsten neuen Ergebnisse dieser Arbeit, die sowohl die Ebenen der Grammatik und Semantik als auch die der Logik und Pragmatik integriert, sind folgende: Im Thai kann der Klf sowohl auf der Element- als auch auf der Mengenebene agieren. In der Verbindung mit einem Demonstrativ kann der Klf auch eine pluralische Interpretation hervorrufen, wenn er auf eine als pluralisch präsupponierte Gesamtmenge referiert oder die Gesamtmenge in einer Teil-Ganzes-Relation individualisiert. In einem Ausdruck, der bereits eine explizite Zahlangabe enthält, bewirkt die Klf-Demonstrativ-Konstruktion eine Kontrastierung von Mengen mit gleichen Eigenschaften. Wie auch der Individualbegriff besitzt der Klf Intension und Extension. Intension und Extension von Thai-Klf verhalten sich umgekehrt proportional, d.h. je spezifischer der Inhalt eines Klf ist, desto kleiner ist sein Umfang. Der Klf signalisiert das Schlüsselmerkmal, das mit der Intension des Nomens der Identifizierung des Objekts dient. Der Klf individualisiert das Nomen, indem er Teilmengen quantifiziert. Er kann sich auf ein Objekt, eine bestimmte Anzahl von Objekten oder auf alle Objekte beziehen. Formal logisch lassen sich diese Funktionen mithilfe des Existenz- und des Allquantors darstellen. Auch die Nullstelle (NST) läßt sich formal logisch darstellen. Auf ihren jeweiligen Informationsgehalt reduziert, ergeben sich für Klf und NST abhängig von ihrer Positionierung verschiedene Informationswerte: Die Opposition von Klf und NST bewirkt in den Fragebögen ausschließlich skalare Q-Implikaturen, die sich durch die Informationsformeln in Form einer Horn-Skala darstellen lassen. In einem sich aufbauenden Kontext transportieren sowohl Klf als auch NST in der Kontextmitte bekannte Informationen, wodurch Implikaturen des M- bzw. I-Prinzips ausgelöst werden. Durch die Verbindung der Informationswerte mit den Implikaturen des Q-, M- und I-Prinzips lässt sich anhand der Positionierung direkt erkennen, wann der Klf die Funktion der Numerus-, der Definitheits- oder der Kontrast-Markierung erfüllt.

Symbolic logic,

"Index of bibliographical references": p. [439]-443.

An introduction to modern logic; an elementary textbook of symbolic logic.

Mode of access: Internet.

A Logic Framework of Normative-based Contract Management

We explore of the feasibility of the computationally oriented institutional agency framework proposed by Governatori and Rotolo testing it against an industrial strength scenario. In particular we show how to encode in defeasible logic the dispute resolution policy described in Article 67 of FIDIC.

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.

The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved since the advent of the first interpreters. However, higher inference speeds are still required in order to meet the demands of applications such as those contemplated for next generation computer systems. The execution of logic programs in parallel is currently considered a promising strategy for attaining such inference speeds. Logic Programming in turn appears as a suitable programming paradigm for parallel architectures because of the many opportunities for parallel execution present in the implementation of logic programs. This dissertation presents an efficient parallel execution model for logic programs. The model is described from the source language level down to an "Abstract Machine" level suitable for direct implementation on existing parallel systems or for the design of special purpose parallel architectures. Few assumptions are made at the source language level and therefore the techniques developed and the general Abstract Machine design are applicable to a variety of logic (and also functional) languages. These techniques offer efficient solutions to several areas of parallel Logic Programming implementation previously considered problematic or a source of considerable overhead, such as the detection and handling of variable binding conflicts in AND-Parallelism, the specification of control and management of the execution tree, the treatment of distributed backtracking, and goal scheduling and memory management issues, etc. A parallel Abstract Machine design is offered, specifying data areas, operation, and a suitable instruction set. This design is based on extending to a parallel environment the techniques introduced by the Warren Abstract Machine, which have already made very fast and space efficient sequential systems a reality. Therefore, the model herein presented is capable of retaining sequential execution speed similar to that of high performance sequential systems, while extracting additional gains in speed by efficiently implementing parallel execution. These claims are supported by simulations of the Abstract Machine on sample programs.

Quase-verdade e pragmatismo

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A framework for supporting knowledge representation – an ontological based approach

Dissertação para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Pragmática de la puntuación y nuevas tecnologías

La puntuación ha evolucionado a lo largo de la historia, no solo en cuanto al número de signos, sino también con respecto a su función de guía en la (re)presentación y el procesamiento del texto. El objetivo del presente artículo es discutir la pragmática de la puntuación en los principales modos de comunicación mediada por ordenador. Mi propuesta consiste en considerar que las nuevas formas escritas de interacción mediada por ordenador situadas en el polo de la inmediatez comunicativa han dado lugar a un particular sistema de puntuación metarrepresentativa que compite con los códigos de puntuación tanto retórico como gramatical.

Robot free will

We introduce the perspex machine which unifies projective geometry and Turing computation and results in a supra-Turing machine. We show two ways in which the perspex machine unifies symbolic and non-symbolic AI. Firstly, we describe concrete geometrical models that map perspexes onto neural networks, some of which perform only symbolic operations. Secondly, we describe an abstract continuum of perspex logics that includes both symbolic logics and a new class of continuous logics. We argue that an axiom in symbolic logic can be the conclusion of a perspex theorem. That is, the atoms of symbolic logic can be the conclusions of sub-atomic theorems. We argue that perspex space can be mapped onto the spacetime of the universe we inhabit. This allows us to discuss how a robot might be conscious, feel, and have free will in a deterministic, or semi-deterministic, universe. We ground the reality of our universe in existence. On a theistic point, we argue that preordination and free will are compatible. On a theological point, we argue that it is not heretical for us to give robots free will. Finally, we give a pragmatic warning as to the double-edged risks of creating robots that do, or alternatively do not, have free will.

Sea surface temperature climate change initiative: alternative image classification algorithms for sea-ice affected oceans

We present a Bayesian image classification scheme for discriminating cloud, clear and sea-ice observations at high latitudes to improve identification of areas of clear-sky over ice-free ocean for SST retrieval. We validate the image classification against a manually classified dataset using Advanced Along Track Scanning Radiometer (AATSR) data. A three way classification scheme using a near-infrared textural feature improves classifier accuracy by 9.9 % over the nadir only version of the cloud clearing used in the ATSR Reprocessing for Climate (ARC) project in high latitude regions. The three way classification gives similar numbers of cloud and ice scenes misclassified as clear but significantly more clear-sky cases are correctly identified (89.9 % compared with 65 % for ARC). We also demonstrate the poetential of a Bayesian image classifier including information from the 0.6 micron channel to be used in sea-ice extent and ice surface temperature retrieval with 77.7 % of ice scenes correctly identified and an overall classifier accuracy of 96 %.

Uma reavaliação do pensamento lógico de George Boole à luz da história da matemática

The aim of the present study is to reevaluate the logical thought of the English mathematician George Boole (1815 - 1864). Thus, our research centers on the mathematical analysis of logic in the context of the history of mathematics. In order to do so, we present various biographical considerations about Boole in the light of events that happened in the 19th century and their consequences for mathematical production. We briefly describe Boole's innovations in the areas of differential equations and invariant theory and undertake an analysis of Boole's logic, especially as formulated in the book The Mathematical Analysis of Logic, comparing it not only with the traditional Aristotelian logic, but also with modern symbolic logic. We conclude that Boole, as he intended, expanded logic both in terms of its content and also in terms of its methods and formal elaboration. We further conclude that his purpose was the mathematical modeling of deductive reasoning, which led him to present an innovative formalism for logic and, because the different ways it can be interpreted, a new conception of mathematics

Lógica-Simbólica e Alfabetização

O presente artigo tenta recuperar as idéias e proposta de H.Furth (1973 ), apontando-a como mais uma opção para tentar trabalhar com as dificuldades das crianças no processo de alfabetização. O autor propõe a substituição das “escolas da linguagem” pelas “escolas do pensamento”, ou seja,substituir a opção do professor no ensino da leitura-escrita, em sua forma tradicional, de como transformar sinais gráficos em sonoros e vice-versa, por aquela do fortalecimento do pensamento, alimentando o intelecto em desenvolvimento da criança por meio de exercícios de “lógica simbólica”.Para nos embasar teoricamente, apresentamos ainda alguns aspectos da teoria psicogenética, bem como outros trabalhos realizados mais recentemente sobre o assunto, que embora “travestidos” (disfarçados) com novas roupagens, ainda encontram seus fundamentos nas obras de J.Piaget.