Lattice-Valued Proposition Logic(Ⅱ)

In this paper, the syntactical problenss of lattice- valued proptnitional logicsystem LP(X) are discuased , the soundness theorem and the deduction thooremare given, and the adequaey problem of LP(X) is solved with slishtrestriction.

Using Vector Representation of Propositions and Actions for STRIPS Action Model Learning

Action model learning has become a hot topic in knowledge engineering for automated planning.A key problem for learning action models is to analyze state changes before and after action executions from observed"plan traces".To support such an analysis,a new approach is proposed to partition propositions of plan traces into states.First,vector representations of propositions and actions are obtained by training a neural network called Skip-Gram borrowed from the area of natural language processing(NLP).Then,a type of semantic distance among propositions and actions is defined based on their similarity measures in the vector space.Finally,k-means and k-nearest neighbor(kNN)algorithms are exploited to map propositions to states.This approach is called state partition by word vector(SPWV),which is implemented on top of a recent action model learning framework by Rao et al.Experimental results on the benchmark domains show that SPWV leads to a lower error rate of the learnt action model,compared to the probability based approach for state partition that was developed by Rao et al.

Re-exploring the Sentence-final Particle “LE” in the Propositional Domain, Epistemic Domain and Dialogic Domain

Previous studies interpreting the meanings of the sentence-final particle“LE”displayed two trends:either excessively complicated or excessively general.Since some scholars established a theoretical foundation of propositional domain,epistemic domain and dialogic domain for the sentence-final particle“LE”,the nature or orientation of its semantic property has become more clear.However,there are also defects in the current“Three Domains”research model.In the first place,this model defines the meanings of the sentence-final particle“LE”as“emergence of new propositional content”,“emergence of new epistemic content”,and“emergence of new dialogic content”.But,the definition is excessively abstract and extensive.As many sentences not concluded with the particle“LE”can also express the three mentioned meanings,it fails to explain the difference between sentences ended with particle“LE”and ones without it.Secondly,the model fails to explore and discuss the nature or generation mechanism of relevant meanings of the particle“LE”.This study attempts to find a practical solution to those defects.

On the Inconsistency of Classical Propositional Calculus

The classical propositional calculus(often called also as“zero-order logic”),is the most fundamental two-valued logical system.It is necessary to construct the classical calculus of quantifiers(often called also as“classical calculus of predicates”or“first-order logic”),which is necessary to construct the classical functional calculus.This last one is being used for formalization of the Arithmetic System.At the beginning of this paper,we introduce a notation and we repeat certain well-known notions(among others,the notions of operation of consequence,a system,consistency in the traditional sense,consistency in the absolute sense)and certain well-known theorems.Next,we establish that classical propositional calculus is an inconsistent theory.

PowerPC Still a RISCy Proposition

ＰｏｗｅｒＰＣＳｔｉｌｌａＲＩＳＣｙＰｒｏｐｏｓｉｔｉｏｎＴａｍｉＺＨＵ（Ｂｏｒｌａｎｄ，ＳｃｏｔｔｓＶａｌｌｅｙ，Ｃａｌｉｆｏｒｎｉａ）ＡｌｌｔｈｅｈｙｐｅｏｖｅｒｔｈｅＰｏｗｅｒＰＣｍａｙｒｅａｃｈｔｈｅｂｏｉｌｉｎｇｐｏｉｎｔｔｈｉｓｙｅａｒａ...

First Event of CIIS Dialogue Held on Multipolar World and Economic Globalization

On April 26,the first event of CIIS Dialogue was held under the theme of“An Equal and Orderly Multipolar World&A Universally Beneficial and Inclusive Economic Globalization:Implications and the Way Forward.”Officials of international organizations in China and renowned scholars at home and abroad had in-depth discussions on the two major Chinese propositions.

Evaluation of the Effect of Assessment Method Reform in “Nursing Research” Course

Objective:This paper aims to evaluate the implementation effect of the diversified course assessment method reform.Methods:A diversified assessment method was implemented for 196 undergraduate nursing students.Students’mastery of key knowledge in“Nursing Research”was assessed through group reports on topic selection and literature retrieval,as well as the proposition level of the final examination.Results:81.6%of the students agreed with the course assessment method,and 97.9%believed studying“Nursing Research”would be helpful for future scientific research applications.Conclusion:Diversified assessment methods can help improve undergraduate nursing students’scientific research skills and comprehensive quality.

Empirical Propositions and the Change of Language- Games

People unavoidably provide reasons for their words and deeds when reasoning in a language-game. Wittgenstein thinks that when people in different language-games argue with one other, they insist on adopting a doubtful attitude toward the reasons provided by the other side. His use of the term ＂language-game＂ here is a metaphor, and implies＇that people in different cultures can scarcely reason with one another. Indeed, according to Wittgenstein＇s consideration of concepts of logic in On Certainty, language-games are incompatible with one another because their internal logic and reasons are different from each other. However, in his discussion of empiricalpropositions Wittgenstein has also shown us the possibility that the internal reasons of one language-game can transmit beyond its own borders and be valid in another language-game.

Theory of truth degrees of formulas in Lukasiewicz n-valued propositional logic and a limit theorem

The concept of truth degrees of formulas in Lukasiewicz n-valued propositional logic Ln is proposed. A limit theorem is obtained, which says that the truth function τ-n induced by truth degrees converges to the integrated truth function τ when n converges to infinite. Hence this limit theorem builds a bridge between the discrete valued Lukasiewicz logic and the continuous valued Lukasiewicz logic. Moreover, the results obtained in the present paper is a natural generalization of the corresponding results obtained in two-valued propositional logic.

Polynomial algorithm of limited propositional deduction

For the problem of propositional satisfiability a polynomial algorithm of limited propositional deduction is proposed which can be viewed as a sort of boolean constraint propagation mechanism. It can be embodied in a backtracking search program for propositional satisfiability problems to make search efficient. The efficiency is gained in two ways:One is to use the algorithm to derive literals so as to overcome the ambiguities in search. The other is to exploit the consequence sets of unbound atoms generated during limited deduction as a heuristic measure for possible choices. The experiments have shown remarkable improvement in reducing search space.

SOME PROPOSITIONS ON SET-SEARCH

All kinds of search techniques in nowaday AI (Artificial Intelhgent) science and engineering are of point-to-point type, and the search path from the starting point (original state) to the goal point (final state) forms a search-tree in the statespace, with a lot of intermediate points (intermediate states) on it.

THE PROOF AND APPLICATION OF M. OZAWA'S PROPOSITION

In 1968, M. Ozawa proposed the following proposition （see Kodai Math. Sem. Rep., 20（1968）, 305-313）: Let f（x） be an entire function, {bn} be an unbounded complex sequence. l1. L2, …lp are p distinct straight lines of the complex plane, any two of which

Nonmonotonic propositional logic

Propositional logic[1]is basic,based on which other logics are developed.The deduction system for propositional logic is monotonic.Nonmonotonic logics are a class of logics which deduction systems are nonmonotonic.Typical ones are default logic[2,3],R-calculus[4],autoepistemic logic[5],circumscription[5],etc.

A Practical Propositional Knowledge Base Revision Algorithm

This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge baize have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method for special case, and gives its corresponding polynomial algorithm.

Proposition on Improving Environmental Forensic System in China

In the early period of China,economy developed rapidly at the cost of environment.Recently,it is generally recognized that the heavily polluted environment not only puts a brake on economic development but also paces negative impact on people’health as well as probably next decades of generations.Accordingly,the latest Environmental Protection Law revised in 2014 makes a clear‑cut division of environmental responsibility and regulates stricter penalties of breaching law.As the new environmental law is enforced gradually,environmental forensic is increasingly required in the process of ascertaining facts in judicial proceedings of environmental cases.Based on the outcomes of documentary analysis for all environmental cases judged on the basis of new environmental law,it is concluded that there still exists problems in the present system of environmental forensic.Thus,this paper is aimed to make proposition on improving Chinese environmental forensic system,which involves:(i)promoting capability of EFS to handle professional questions;(ii)develop price mechanism;(iii)multidepartments cooperate to establish unifying and complete EFS system;and(iv)enhance the probative value of results of EFS.Such protocol for amending present regulation on environmental forensic is of significant importance because a quality report of environmental forensic will contribute to provide strong probative evidence of culprits’activity of releasing contaminant into environment,degree of damages for victims,and above all,causality between the behavior of public nuisance and damages.

A Slippery Proposition

Energy experts weigh the pros and cons of China becoming a member of the International Energy Agency Despite proposals by some foreign government officials and members of the International Energy Agency (TEA), China is not about to make a decision to join

Une étude sur la Fonction Textuelle du Connecteur :le Topique et la Cha?ne Parlée

Les constituants d’un énoncé possèdent des fonctions syntaxiques différentes. L’analyse d’une proposition a pour but d’indiquer les fonctions jouées par les mots ou groupes de mots dans cette proposition, et faire l’analyse d’une phrase revient à indiquer les fonctions jouées par les propositions de la phrase.

在变乱交织的世界中坚决维护国家安全

To build a modern socialist country in an all-encompassing way is a great and arduous historical mission facing China and also a great and arduous cause in the course of human history.The comprehensive construction of Chinese modernization is an important part of the century-old diplomatic process.China’s great reform should also be realized against the backdrop of global changes.In recent academic exchanges,some experts and scholars at home and abroad have stressed the proposition that how China and the outside world adjust their relations has become the core issue of global politics in the twenty-first century.With the passage of time and the deepening ofcommunication,this proposition has been recognized by more people.

PSL的有界模型检验

基于SAT的有界模型检验被视为是基于OBDD的符号化模型检验技术的重要补充,是并行反应式系统的一种有效验证方法.然而,直至现在,有界模型检验已验证的属性逻辑还十分有限.PSL是一种用于描述并行系统的属性规约语言(IEEE-1850),包括线性时序逻辑FL和分支时序逻辑OBE两部分.通过模型检验可验证系统的PSL属性,本文提出了PSL的有界模型检验方法及其算法框架.首先,定义PSL逻辑的有界语义,而后,将有界语义进一步简化为SAT,分别将PSL性质规约公式和系统M的状态迁移关系转换为SAT命题公式,最后验证上述两个SAT命题公式合取式的可满足性,这样就将时序逻辑PSL的存在模型检验转化为一个命题公式的可满足性问题,并用一个队列控制电路实例具体解释算法执行过程.