Parameter selection based on fuzzy logic to improve UAV path-following algorithms

In order to steer an Unmanned Aerial Vehicle (UAV) and make it follow a desired trajectory, a high level controller is needed. Depending on the control algorithm, one or more parameters have to be tuned, having their values high impact on the performance. In most of the works, these parameters are taken as constant. In this paper, we apply fuzzy logic to select the parameters of the control law and compare this approach with the tuning by constant parameters and with another adjusting method based on the kinematic analysis of the equations of the UAV. After many simulations of the quadrotor following randomly generated paths, we have proved that the fuzzy tuning law is not only a good and feasible solution, but also more general as it can be applied to any trajectory.     

Disagreements Over Analogies

This essay presents a dialogical framework for treating philosophical disagreements as persuasion dialogues with analogical argumentation, with the aim of recasting philosophical disputes as disagreements over analogies. This has two benefits: (1) it allows us to temporarily bypass conflicting metaphysical intuitions by focusing on paradigmatic examples, (dis)similarities, and the plausibility of conclusions for or against a given point of view; and (2) it can reveal new avenues of argumentation regarding a given issue. This approach to philosophical disagreements is illustrated by studying the role of argumentation by analogy in disputes over Lockean justifications of intellectual property rights, and disagreements over whether artificial agents should be treated as moral agents. Finally, a nonexhaustive list of possible global and local points of contention over analogical arguments is identified in order to highlight potential avenues of argumentation in disagreements over analogies.     

The four antinomies of the death instinct1

Matte Blanco examines four paradoxical positions that arise out of Freud's writings on the death instinct. He notes that death is not a content known to the unconscious. Furthermore, the absence of time and space in the unconscious means that the conditions necessary for any process such as instinct are similarly absent. Matte Blanco demonstrates the way in which the antinomies that he explores can be explained in terms of the logics that obtain in the unconscious, and he suggests that the concept of the death instinct is one of the most profound expressions of the relationship between the modes that underlie conscious and unconscious logic.     

从"炸药"到"伟哥"创新历程的启示--科学创新思维中的逻辑与直觉

国家的经济发展需要科学创新的成果,而创新的成果源自创新的思维.法国数学家彭加勒在谈到创新性的思维时说过:"逻辑用于论证,直觉用于发明",并提出了创造性的科学思维活动的"三段式"理论.从"炸药"到"伟哥"科学创新的百年历程中,去验证和探究彭加勒的科学哲学思维,以及这个理论中包含的逻辑与直觉的关系.     

科学发展与文化逻辑--从杨振宁论中国无科学的观点说起

每一个文明都有自己存在的理由和发展的逻辑线路,不同文明可以有不同的发展程度,但不能有凌驾于其他文明之上的话语解释权.近代科学作为近代西方文明的产物,也同时是古代多种文明融合的产物.科学发展离不开自身所属的文化逻辑,但反过来具备同等文化逻辑的文明未必就一定产生科学.科学作为文化的一种形态,它没有必要成为所有文明的必经之路.我们在尊重、发展作为现代化工具的科学技术的同时,要反对用科学话语来解释工具之上的东西.     

Combinator Logics

Combinator logics are a broad family of substructual logics that are formed by extending the basic relevant logic B with axioms that correspond closely to the reduction rules of proper combinators in combinatory logic. In the Routley-Meyer relational semantics for relevant logic each such combinator logic is characterized by the class of frames that meet a first-order condition that also directly corresponds to the same combinator's reduction rule. A second family of logics is also introduced that extends B with the addition of propositional constants that correspond to combinators. These are characterized by relational frames that meet first-order conditions that reflect the structures of the combinators themselves.     

A Sequent Formulation of Conditional Logic Based on Belief Change Operations

Peter Gärdenfors has developed a semantics for conditional logic, based on the operations of expansion and revision applied to states of information. The account amounts to a formalisation of the Ramsey test for conditionals. A conditional A > B is declared accepted in a state of information K if B is accepted in the state of information which is the result of revising K with respect to A. While Gärdenfors's account takes the truth-functional part of the logic as given, the present paper proposes a semantics entirely based on epistemic states and operations on these states. The semantics is accompanied by a syntactic treatment of conditional logic which is formally similar to Gentzen's sequent formulation of natural deduction rules. Three of David Lewis's systems of conditional logic are represented. The formulations are attractive by virtue of their transparency and simplicity.     

Early Examples of Resource-Consciousness

As with the development of several logical notions, it is shown that the concept of resource-consciousness, i. e. the concern over the number of times that a given sentence is used in the proof of another sentence, has its origin in the foundations of geometry, pre-dating its appearence in logical circles as BCK-logic or affine logic.     

Epistemology and artificial intelligence

In this essay we advance the view that analytical epistemology and artificial intelligence are complementary disciplines. Both fields study epistemic relations, but whereas artificial intelligence approaches this subject from the perspective of understanding formal and computational properties of frameworks purporting to model some epistemic relation or other, traditional epistemology approaches the subject from the perspective of understanding the properties of epistemic relations in terms of their conceptual properties. We argue that these two practices should not be conducted in isolation. We illustrate this point by discussing how to represent a class of inference forms found in standard inferential statistics. This class of inference forms is interesting because its members share two properties that are common to epistemic relations, namely defeasibility and paraconsistency. Our modeling of standard inferential statistical arguments exploits results from both logical artificial intelligence and analytical epistemology. We remark how our approach to this modeling problem may be generalized to an interdisciplinary approach to the study of epistemic relations.     

An evolutionary system for neural logic networks using genetic programming and indirect encoding

Nowadays, intelligent connectionist systems such as artificial neural networks have been proved very powerful in a wide area of applications. Consequently, the ability to interpret their structure was always a desirable feature for experts. In this field, the neural logic networks (NLN) by their definition are able to represent complex human logic and provide knowledge discovery. However, under contemporary methodologies, the training of these networks may often result in non-comprehensible or poorly designed structures. In this work, we propose an evolutionary system that uses current advances in genetic programming that overcome these drawbacks and produces neural logic networks that can be arbitrarily connected and are easily interpretable into expert rules. To accomplish this task, we guide the genetic programming process using a context-free grammar and we encode indirectly the neural logic networks into the genetic programming individuals. We test the proposed system in two problems of medical diagnosis. Our results are examined both in terms of the solution interpretability that can lead in knowledge discovery, and in terms of the achieved accuracy. We draw conclusions about the effectiveness of the system and we propose further research directions.