Wetgewing wat onbestaanbaar is met die bepalings van Wet 200 van 1993 as die hoogste reg is nietig tensy geoorloof volgens die maatstawwe van art 33 (1) 1 en die Konstitusionele Hof en die provinsiale en plaaslike afdelings van die Hooggeregshof is bevoeg om dit ongeldig te verklaar. Die beoordeling van die geldigheid van wetgewing waardeur inbreuk gemaak word op 'n Fundamentele Reg of Vryheid in Hoofstuk 3 verleen 1 vereis in eerste instansie die vertolking van die betrokke bepaling van die Hoofstuk. In die lig van die besondere karakter van 'n grondwet en die gebrek aan omlyning van die verleende regte en vryhede 1 moet die vertolking nie volgens geykte metodes geskied nie I maar wel doelgerig aan die hand van die waardes onderliggend tot die Handves as geheel. Waardes wat nie herleibaar is tot die grondwet self nie en die persoonlike filosofiee van die regters behoort die howe egter nie te beinvloed nie. / Legislation inconsistent with the provisions of Act 200 of 1993 as the supreme law is of no force and effect and the Constitutional Court and the provincial and local divisions of the Supreme Court may declare it invalid, unless it complies with the criteria of a permissible limitation under sec 33(1). Before the validity of legislation impinging upon a Fundamental Right or Freedom conferred in Chapter 3 can be considered, the relevant provision of the Chapter must first be interpreted. In view of the special nature of a constitution and the generality of the conferred rights and freedoms, the ordinary methods of interpretation should not be applied. Chapter 3 must be interpreted purposively taking into account the values underlying the Bill of Rights as a whole. Values not founded in the Constitution and the personal philosophies of the judges ought not to influence the courts. / Private Law / LL.M.

Software systems usually consist of multiple artefacts, such as requirements, class diagrams, or source code. Documents, such as specifications and documentation, can also be viewed as artefacts. In practice, however, writing and updating documents is often neglected because it is expensive and brings no immediate benefit. Consequently, documents are often outdated and communicate wrong information about the software. The price is paid later when a software system must be maintained and much implicit knowledge that existed at the time of the original development has been lost. A simple way to keep documents up to date is generation. However, not all documents can be fully generated. Usually, at least some content must be written by a human author. This handwritten content is lost if the documents must be regenerated. In this thesis, Elucidative Development is introduced. It is an approach to create documents by partial generation. Partial generation means that some parts of the document are generated whereas others are handwritten. Elucidative Development retains manually written content when the document is regenerated. An integral part of Elucidative Development is a guidance system, which informs the author about changes in the generated content and helps him update the handwritten content. / Softwaresysteme setzen sich üblicherweise aus vielen verschiedenen Artefakten zusammen, zum Beispiel Anforderungen, Klassendiagrammen oder Quellcode. Dokumente, wie zum Beispiel Spezifikationen oder Dokumentation, können auch als Artefakte betrachtet werden. In der Praxis wird aber das Schreiben und Aktualisieren von Dokumenten oft vernachlässigt, weil es zum einen teuer ist und zum anderen keinen unmittelbaren Vorteil bringt. Dokumente sind darum häufig veraltet und vermitteln falsche Informationen über die Software. Den Preis muss man später zahlen, wenn die Software gepflegt wird, weil viel von dem impliziten Wissen, das zur Zeit der Entwicklung existierte, verloren ist. Eine einfache Möglichkeit, Dokumente aktuell zu halten, ist Generierung. Allerdings können nicht alle Dokumente generiert werden. Meist muss wenigstens ein Teil von einem Menschen geschrieben werden. Dieser handgeschriebene Inhalt geht verloren, wenn das Dokument neu generiert werden muss. In dieser Arbeit wird das Elucidative Development vorgestellt. Dabei handelt es sich um einen Ansatz zur Dokumenterzeugung mittels partieller Generierung. Das bedeutet, dass Teile eines Dokuments generiert werden und der Rest von Hand ergänzt wird. Beim Elucidative Development bleibt der handgeschriebene Inhalt bestehen, wenn das restliche Dokument neu generiert wird. Ein integraler Bestandteil von Elucidative Development ist darüber hinaus ein Hilfesystem, das den Autor über Änderungen an generiertem Inhalt informiert und ihm hilft, den handgeschriebenen Inhalt zu aktualisieren.

Nesta tese apresentamos o projeto e a implementação do KEMS, um provador de teoremas multi-estratégia baseado no método de tablôs KE. Um provador de teoremas multi-estratégia é um provador de teoremas onde podemos variar as estratégias utilizadas sem modificar o núcleo da implementação. Além de multi-estratégia, o KEMS é capaz de provar teoremas em três sistemas lógicos: lógica clássica proposicional, mbC e mCi. Listamos abaixo algumas das contribuições deste trabalho: * um sistema KE para mbC que é analítico, correto e completo; * um sistema KE para mCi que é correto e completo; * um provador de teoremas multi-estratégia com as seguintes características: - aceita problemas em três sistemas lógicos: lógica clássica proposicional, mbC e mCi; - tem seis estratégias implementadas para lógica clássica proposicional, duas para mbC e duas para mCi; - tem treze ordenadores que são usados em conjunto com as estratégias; - implementa regras simplificadoras para lógica clássica proposicional; - possui uma interface gráfica que permite a visualização de provas; - é de código aberto e está disponível na Internet em http://kems.iv.fapesp.br; * benchmarks obtidos através da comparação das estratégias para lógica clássica proposicional resolvendo várias famílias de problemas; - sete famílias de problemas para avaliar provadores de teoremas paraconsistentes; * os primeiros benchmarks para as famílias de problemas para avaliar provadores de teoremas paraconsistentes. / In this thesis we present the design and implementation of KEMS, a multi-strategy theorem prover based on the KE tableau inference system. A multi-strategy theorem prover is a theorem prover where we can vary the strategy without modifying the core of the implementation. Besides being multi-strategy, KEMS is capable of proving theorems in three logical systems: classical propositional logic, mbC and mCi. We list below some of the contributions of this work: * an analytic, correct and complete KE system for mbC; * a correct and complete KE system for mCi; * a multi-strategy prover with the following characteristics: - accepts problems in three logical systems: classical propositional logic, mbC and mCi; - has 6 implemented strategies for classical propositional logic, 2 for mbC and 2 for mCi; - has 13 sorters to be used alongside with the strategies; - implements simplification rules of classical propositional logic; - provides a proof viewer with a graphical user interface; - it is open source and available on the internet at http://kems.iv.fapesp.br; * benchmark results obtained by KEMS comparing its classical propositional logic strategies with several problem families; * seven problem families designed to evaluate provers for logics of formal inconsistency; * the first benchmark results for the problem families designed to evaluate provers for logics of formal inconsistency.

For this work, two algorithms have been developed to improve the performance of the inconsistency detection by using Merkle trees. The first builds a hash tree from a database schema version, and the second compares two hash trees to find where changes have occurred. The results of performance testing done on the hash tree approach compared to the current approach used by Cisco where all data in the schema is traversed, shows that the hash tree algorithm for inconsistency detection performs significantly better than the complete traversal algorithm in all cases tested, with the exception of when all nodes have changed in the tree. The factor of improvement is directly related to the number of nodes that have to be traversed for the hash tree, which in turn depends on the number of changes done between versions and the positioning in the schema of the nodes that have changed. The real-life example scenarios used for performance testing show that on average, the hash tree algorithm only needs to traverse 1,5% of the number of nodes that the complete traversal algorithm used by Cisco does, and on average gives a 200 times improvement in performance. Even in the worst real-life case used for testing, the hash tree algorithm performed five times better than the complete traversal algorithm. / I detta arbete har två algoritmer utvecklats for att förbättra prestandan på processen att hitta skillnader mellan schemana genom att använda Merkle träd. Den första bygger ett hashträd från schemaversionen, och den andra jämför två hashträd för att hitta var förändringar har skett. Resultaten från prestandautvärderingen som gjorts på hashträdalgoritmen jämfört med nuvarande algoritm som används på Cisco där all data i schemat traverseras, visar att hashträdalgoritmen presterar signifikant bättre än algoritmen som traverserar all data i alla fall som testats, förutom då alla noder har ändrats i trädet. Förbättringsfaktorn är direkt kopplad till antalet noder som behöver traverseras för hashträdalgoritmen, vilket i sin tur beror på antalet förändringar som skett mellan versionerna och positioneringen i schemat av de noder som har förändrats. De exempelscenarior som har tagits från riktiga uppdateringar som har skett för existerande scheman visar att i genomsnitt behöver hashträdalgoritmen bara traversera 1,5% av noderna som den nuvarande algoritmen som används av Cisco måste traversera, och hashträdalgoritmen ger i genomsnitt en 200 gånger prestandaförbättring. Även i det värsta fallet för dessa uppdateringar tagna från verkliga scenarier presterade hashträdalgoritmen fem gånger bättre än algoritmen som traverserar all data i schemat.

Diss. Stockholm : Handelshögskolan, 2009

The purpose of the present investigation was to examine whether across-trials inconsistency in reaction time (RT), in addition to level of cognitive performance, is predictive of older adults’ performance on a measure of everyday problem solving through a series of three investigations. A sample of community dwelling non-demented older adults, ranging in age from 62 to 92, completed the Everyday Problems Test (EPT), a measure of everyday problem solving that indexes instrumental activities of daily living (IADLs). Performance on the EPT varied according to age, cognitive status, and education, and was significantly predicted by measures of global cognitive status, cognitive decline, and various basic cognitive abilities (i.e., speed of processing, fluid abilities, episodic memory, crystallized abilities). Both inconsistency and mean latencies on measures of RT were found to be significantly associated with concurrent EPT performance, such that slower and more inconsistent RTs were associated with poorer everyday problem solving abilities. Finally, inconsistency in RT made a unique contribution in predicting performance on the EPT two years later, over and above age, education, and various basic cognitive abilities. Structural equation modeling analyses indicated that the relationship between inconsistency in RT and future EPT performance was mediated by fluid and crystallized abilities. Neither inconsistency nor cognitive functioning were significantly associated with changes in EPT performance across two years. Examination of the relationships between IADL functioning, as assessed through self- and informant-report, and inconsistency and basic cognitive abilities demonstrated that everyday problem solving and measures of IADLs tap into related but distinct constructs. The overall pattern of results obtained lends support to the idea that inconsistency in RT represents a behavioural marker of neurological dysfunction. In addition, the present investigation is the first to suggest a relationship between inconsistency in RT and real-world outcomes, such as everyday problem solving and IADL functioning.

Σκοπός της παρούσας διπλωματικής είναι να εξετάσει την επίδραση στην μακροοικονομική απόδοση της ανεξαρτησίας της Κεντρικής Τράπεζας. Αποτελεί ενδιαφέρον θέμα τόσο για τις νεοεισερχόμενες χώρες της Ευρωπαικής Ένωσης αλλά και για τις χώρες που εμφανίζουν ιδιαίτερα υψηλό πληθωρισμό. / The purpose of this paper is to examine the impact of the central bank independence on the macroeconomic performance.It is considered to be a very interesting topic not only for the 'newcomers'countries to the European Union but also for the countries with high inflation.

Wetgewing wat onbestaanbaar is met die bepalings van Wet 200 van 1993 as die hoogste reg is nietig tensy geoorloof volgens die maatstawwe van art 33 (1) 1 en die Konstitusionele Hof en die provinsiale en plaaslike afdelings van die Hooggeregshof is bevoeg om dit ongeldig te verklaar. Die beoordeling van die geldigheid van wetgewing waardeur inbreuk gemaak word op 'n Fundamentele Reg of Vryheid in Hoofstuk 3 verleen 1 vereis in eerste instansie die vertolking van die betrokke bepaling van die Hoofstuk. In die lig van die besondere karakter van 'n grondwet en die gebrek aan omlyning van die verleende regte en vryhede 1 moet die vertolking nie volgens geykte metodes geskied nie I maar wel doelgerig aan die hand van die waardes onderliggend tot die Handves as geheel. Waardes wat nie herleibaar is tot die grondwet self nie en die persoonlike filosofiee van die regters behoort die howe egter nie te beinvloed nie. / Legislation inconsistent with the provisions of Act 200 of 1993 as the supreme law is of no force and effect and the Constitutional Court and the provincial and local divisions of the Supreme Court may declare it invalid, unless it complies with the criteria of a permissible limitation under sec 33(1). Before the validity of legislation impinging upon a Fundamental Right or Freedom conferred in Chapter 3 can be considered, the relevant provision of the Chapter must first be interpreted. In view of the special nature of a constitution and the generality of the conferred rights and freedoms, the ordinary methods of interpretation should not be applied. Chapter 3 must be interpreted purposively taking into account the values underlying the Bill of Rights as a whole. Values not founded in the Constitution and the personal philosophies of the judges ought not to influence the courts. / Private Law / LL.M.

Orientador: Marcelo Esteban Coniglio / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas / Made available in DSpace on 2018-08-17T03:29:03Z (GMT). No. of bitstreams: 1 Rodrigues_TarcisioGenaro_M.pdf: 1141020 bytes, checksum: 59bb8a3ae7377c05cf6a8d8e6f7e45a5 (MD5) Previous issue date: 2010 / Resumo: A Programação Lógica nasce da interação entre a Lógica e os fundamentos da Ciência da Computação: teorias de primeira ordem podem ser interpretadas como programas de computador. A Programação Lógica tem sido extensamente utilizada em ramos da Inteligência Artificial tais como Representação do Conhecimento e Raciocínio de Senso Comum. Esta aproximação deu origem a uma extensa pesquisa com a intenção de definir sistemas de Programação Lógica paraconsistentes, isto é, sistemas nos quais seja possível manipular informação contraditória. Porém, todas as abordagens existentes carecem de uma fundamentação lógica claramente definida, como a encontrada na programação lógica clássica. A questão básica é saber quais são as lógicas paraconsistentes subjacentes a estas abordagens. A presente dissertação tem como objetivo estabelecer uma fundamentação lógica e conceitual clara e sólida para o desenvolvimento de sistemas bem fundados de Programação Lógica Paraconsistente. Nesse sentido, este trabalho pode ser considerado como a primeira (e bem sucedida) etapa de um ambicioso programa de pesquisa. Uma das teses principais da presente dissertação é que as Lógicas da Inconsistência Formal (LFI's), que abrangem uma enorme família de lógicas paraconsistentes, proporcionam tal base lógica. Como primeiro passo rumo à definição de uma programação lógica genuinamente paraconsistente, demonstramos nesta dissertação uma versão simplificada do Teorema de Herbrand para uma LFI de primeira ordem. Tal teorema garante a existência, em princípio, de métodos de dedução automática para as lógicas (quantificadas) em que o teorema vale. Um pré-requisito fundamental para a definição da programação lógica é justamente a existência de métodos de dedução automática. Adicionalmente, para a demonstração do Teorema de Herbrand, são formuladas aqui duas LFI's quantificadas através de sequentes, e para uma delas demonstramos o teorema da eliminação do corte. Apresentamos também, como requisito indispensável para os resultados acima mencionados, uma nova prova de correção e completude para LFI's quantificadas na qual mostramos a necessidade de exigir o Lema da Substituição para a sua semântica / Abstract: Logic Programming arises from the interaction between Logic and the Foundations of Computer Science: first-order theories can be seen as computer programs. Logic Programming have been broadly used in some branches of Artificial Intelligence such as Knowledge Representation and Commonsense Reasoning. From this, a wide research activity has been developed in order to define paraconsistent Logic Programming systems, that is, systems in which it is possible to deal with contradictory information. However, no such existing approaches has a clear logical basis. The basic question is to know what are the paraconsistent logics underlying such approaches. The present dissertation aims to establish a clear and solid conceptual and logical basis for developing well-founded systems of Paraconsistent Logic Programming. In that sense, this text can be considered as the first (and successful) stage of an ambitious research programme. One of the main thesis of the present dissertation is that the Logics of Formal Inconsistency (LFI's), which encompasses a broad family of paraconsistent logics, provide such a logical basis. As a first step towards the definition of genuine paraconsistent logic programming we shown, in this dissertation, a simplified version of the Herbrand Theorem for a first-order LFI. Such theorem guarantees the existence, in principle, of automated deduction methods for the (quantified) logics in which the theorem holds, a fundamental prerequisite for the definition of logic programming over such logics. Additionally, in order to prove the Herbrand Theorem we introduce sequent calculi for two quantified LFI's, and cut-elimination is proved for one of the systems. We also present, as an indispensable requisite for the above mentioned results, a new proof of soundness and completeness for first-order LFI's in which we show the necessity of requiring the Substitution Lemma for the respective semantics / Mestrado / Filosofia / Mestre em Filosofia

The purpose of the present investigation was to examine whether across-trials inconsistency in reaction time (RT), in addition to level of cognitive performance, is predictive of older adults’ performance on a measure of everyday problem solving through a series of three investigations. A sample of community dwelling non-demented older adults, ranging in age from 62 to 92, completed the Everyday Problems Test (EPT), a measure of everyday problem solving that indexes instrumental activities of daily living (IADLs). Performance on the EPT varied according to age, cognitive status, and education, and was significantly predicted by measures of global cognitive status, cognitive decline, and various basic cognitive abilities (i.e., speed of processing, fluid abilities, episodic memory, crystallized abilities). Both inconsistency and mean latencies on measures of RT were found to be significantly associated with concurrent EPT performance, such that slower and more inconsistent RTs were associated with poorer everyday problem solving abilities. Finally, inconsistency in RT made a unique contribution in predicting performance on the EPT two years later, over and above age, education, and various basic cognitive abilities. Structural equation modeling analyses indicated that the relationship between inconsistency in RT and future EPT performance was mediated by fluid and crystallized abilities. Neither inconsistency nor cognitive functioning were significantly associated with changes in EPT performance across two years. Examination of the relationships between IADL functioning, as assessed through self- and informant-report, and inconsistency and basic cognitive abilities demonstrated that everyday problem solving and measures of IADLs tap into related but distinct constructs. The overall pattern of results obtained lends support to the idea that inconsistency in RT represents a behavioural marker of neurological dysfunction. In addition, the present investigation is the first to suggest a relationship between inconsistency in RT and real-world outcomes, such as everyday problem solving and IADL functioning.