汉语无关联词因果复句的命题表征项目互换效应

采用句子—图画验证任务探讨了汉语无关联词因果复句的命题表征项目互换效应。结果表明 ,汉语无关联词因果复句的项目表达顺序为“结果→原因”时 ,所形成的命题表征中项目发生互换 ,其结果为“原因→结果”。本研究结果初步表明 ,在没有关联词的语法提示条件下 ,读者在理解汉语无关联词的因果复句的过程中能够根据其语义内容按照“原因→结果”固定方向进行系列的认知加工     

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.     

Proof theory and mathematical meaning of paraconsistent C-systems

A proof-theoretic analysis and new arithmetical semantics are proposed for some paraconsistent C-systems, which are a relevant sub-class of Logics of Formal Inconsistency (LFIs) introduced by W.A. Carnielli et al. (2002, 2005) [8] and [9]. The sequent versions BC, CI, CIL of the systems bC, Ci, Cil presented in Carnielli et al. (2002, 2005) [8] and [9] are introduced and examined. BC, CI, CIL admit the cut-elimination property and, in general, a weakened sub-formula property. Moreover, a formal notion of constructive paraconsistent system is given, and the constructivity of CI is proven. Further possible developments of proof theory and provability logic of CI-based arithmetical systems are sketched, and a possible weakened Hilbert?s program is discussed. As to the semantical aspects, arithmetical semantics interprets C-system formulas into Provability Logic sentences of classical Arithmetic PA (Artemov and Beklemishev (2004) [2], Japaridze and de Jongh (1998) [19], Gentilini (1999) [15], Smorynski (1991) [22]): thus, it links the notion of truth to the notion of provability inside a classical environment. It makes true infinitely many contradictions B∧¬B and falsifies many arbitrarily complex instances of non-contradiction principle ¬(A∧¬A). Moreover, arithmetical models falsify both classical logic LK and intuitionistic logic LJ, so that a kind of metalogical completeness property of LFI-paraconsistent logic w.r.t. arithmetical semantics is proven. As a work in progress, the possibility to interpret CI-based paraconsistent Arithmetic PACI into Provability Logic of classical Arithmetic PA is discussed, showing the role that PACIarithmetical models could have in establishing new meta-mathematical properties, e.g. in breaking classical equivalences between consistency statements and reflection principles.     

Justification logics and hybrid logics

Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since justification logics are newer and less well known than hybrid logics, we sketch their background, and give pointers to their range of applicability. We conclude with suggestions for future research. Indeed, the main goal of this paper is to encourage others to continue the investigation begun here.     

Parallelism in the Early Moist Texts

Parallelism is present everywhere in the early Moist texts: at the syntactic level, at the semantic level, between sentences, between sets of sentences, between argumentative structures. The present article gives many examples of the phenomenon: parallelism of insistence, insistence from top to bottom, insistence from bottom to top, parallelism with symmetry, parallelism involving negation, subcontraries and negation at deeper levels, parallelism of the argumentative structures. Logic is particularly applied to the study of parallelism involving negation. From the point of view of argumentation, it is shown that many of those constructions have an important role in supporting arguments such as: arguments of generalization, a fortiori arguments, arguments of exemplarity, consequentialist arguments, arguments by comparison. This study draws the attention to the importance of argumentation in the study of Moism and gives a new light on the argument by parallelism (mou 侔) in the “Xiaoqu”: It is a natural extension of what we call “parallelism involving negation,” already very common in the early Moist texts.     

祈使句和反问句中双重否定的加工机制

采用句-图匹配范式,以可预测对立意义的句子和图片为实验材料,考察汉语双重否定的加工方式以及句子的形式与语义对句子加工的影响,包括2个实验。研究发现：（1）双重否定是整体加工的;（2）在理解初期（250ms）,否定反问句、双重否定祈使句与肯定祈使句的加工模式一致,都是直接表征事件的实际状态;（3）当句子形式与语义不一致时,读者更多地受到句子语义的影响。这表明,在双重否定加工机制的理论解释中,命题表征理论忽略语义,注重句子形式结构,而基于经验模拟理论的两步模拟假设则立足语义,忽略句子形式结构,两者都有一定的合理性,但也都存在一定的片面性。