Implementing Semantic Deduction of Propositional Knowledge in an Extension Multi-layer Perceptron

The paper presents an extension multi-laye r p erceptron model that is capable of representing and reasoning propositional know ledge base. An extended version of propositional calculus is developed, and its some properties is discussed. Formulas of the extended calculus can be expressed in the extension multi-layer perceptron. Naturally, semantic deduction of prop ositional knowledge base can be implement by the extension multi-layer perceptr on, and by learning, an unknown formula set can be found.

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.

AN EQUIVALENT PROPOSITION TO THE CONJECTURE OF GOLDBACH

In this paper,a formula is given. The formula gives the number of prime number solutions of the indefinite equation p 1+p 2=2n , and based on it, an equivalent proposition to the conjecture of Goldbach is obtained.

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.

Soft-Resolution Method of Six-Element Linguistic Truth-Valued Intuitionistic Fuzzy Propositional Logic

＂In this paper, we construct a six-element intuitionistic linguistic truth-valued fuzzy propositional logic （6LTV-IP） based on the framework of linguistic truth-valued propoitional logic, which can express bath the comparable and incomparable truth values. Truth degree and falsity degree of intuitionistic fuzzy proposition are two truth values with linguistic hedge. With the concrete logic operation of 6LTV-IP, some special properties are obtained. Then based on （α, β）-complementary literals and （a, β）-similar literals, we propose a soft-resolution method of 6LTV-IP.

Methodological Proposition of an Integrated System for Urban Floods Control

In the State of Santa Catarina, Brazil, especially in the Itajai valley, there are records of accidents and disasters mainly associated to landslides and floods, which have caused significant damages and losses, including human lives. In order to make the coexistence with such natural disasters possible, most particularly with floods, a integration is required among the technical, political, environmental, and human knowledge. Measures that encompass integrated actions for the entire river basin, with the help from an updated technical cadastre and tools, such as the GIS, allow the development of planning tools that might effectively help the people to live with the water, or else to cope with floods in a more appropriate manner. This paper attempts to propose a methodology for urban flood control, based on the integration among the several public entities involved in the flood control, along with the CTM （Multipurpose Technical Cadastre） and GIS tool. In order to solve or minimize the problems, the model proposed here aims at promoting a balance between the agents involved, and enables to rank the degrees of importance assigned to the different needs, thus allowing to eliminate or to improve those areas and processes that are duplicated or superimposed.

如何讲解“普通语言学”中的“Propositional Logic”

研究复合命题真值问题的真值逻辑和自然语言逻辑不尽相同。解释命题、命题逻辑和其涉及的否定、合取、析取、蕴涵和等价等定义,同时分析它们的形式和用法。

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.

Stakeholders＇ Value Proposition Research in the Enterprise Synergy Innovation

Service dominant logic is one brand new economy model and it consider all the participators to be the potential resource integrators. The enterprise should put forward the value proposition with open attitude to achieve the enterprise synergy innovation. This paper analyses the value proposition on the stakeholders in the enterprise synergy innovation and expand the one way value proposition theory to the different stakeholder groups inside and outside of the enterprise. The theoretical significance of this paper is to provide the theoretical reference for the enterprise synergy innovation to establish sustainable and stable stakeholders＇ relationship.

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

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

Wing Chun Culture:Bridge of Mutual Understanding Between China and Sri Lanka

The art of Wing Chun transcends geographical boundaries and cultural differences,with an impressive number of over 10 million practitioners spread across more than 80 countries and regions.This remarkable global reach serves as a testament to its captivating allure and unparalleled ability to forge connections among individuals from diverse backgrounds.

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.

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.

＂Snow＇s Proposition＂ and Interdisciplinary Research in the Humanities and Social Sciences

＂Snow＇s proposition＂ points out the contradictions and conflicts between ＂scientific culture＂ and ＂literary culture＂ and the dilemma of the development of the ＂two cultures.＂ In the positive sense, Snow＇s proposition concerns the contradictions between the integrity of the research subject and the particularity of established disciplines, as well as the trend toward division and isolation in subdivisions of the humanities and social sciences. The key to solving Snow＇s proposition is to take an inter-disciplinary path that pays particular attention to combining discipline-centered with issue-centered research and individual work with teamwork, giving full play to individual endowment, social orientation and environmental orientation and to the optimization of evaluation systems and mechanisms.

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.

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.

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.