期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到81篇文章
< 1 2 … 5 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Soft-Resolution Method of Six-Element Linguistic Truth-Valued Intuitionistic Fuzzy Propositional Logic 认领 引用
1
作者 刘新 殷明娥 +1 位作者 孙芳 邹丽 《Journal of Donghua University(English Edition)》 EI CAS 2010年第2期135-138,共4页
＂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... ＂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. 展开更多
关键词 lattice implication intuitionisitc propositional logic resolution method
暂未订购 下载PDF
Implementing Semantic Deduction of Propositional Knowledge in an Extension Multi-layer Perceptron 认领 引用
2
作者 HUANG Tian-min,PEI Zheng 《Chinese Quarterly Journal of Mathematics》 2003年第3期247-257,共11页
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 prop... 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. 展开更多
关键词 multi-layer perceptron extension multi-layer perce p tron propositional calculus propositional knowledge buse semantic deduction
暂未订购 下载PDF
Re-exploring the Sentence-final Particle “LE” in the Propositional Domain, Epistemic Domain and Dialogic Domain 认领 引用
3
作者 DENG Yu-yang 《Journal of Literature and Art Studies》 2019年第1期63-68,共6页
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 pro... 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. 展开更多
关键词 sentence-final particle“LE” propositional domain epistemic domain dialogic domain
暂未订购 下载PDF
On the Inconsistency of Classical Propositional Calculus 认领 引用
4
作者 Teodor J.Stepien Lukasz T.Stepien 《Journal of Mathematics and System Science》 2020年第1期13-14,共2页
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... 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. 展开更多
关键词 Classical propositional calculus consistency in the traditional sense consistency in the absolute sense
暂未订购 下载PDF
Theory of truth degrees of formulas in Lukasiewicz n-valued propositional logic and a limit theorem 认领 引用 被引量：32
5
作者 LI Bijing WANG Guojun 《Science in China(Series F)》 2005年第6期727-736,共10页
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 integ... 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. 展开更多
关键词 Lukasiewicz n-valued propositional logic truth degree limit theorem integrated truth degree
Nonmonotonic propositional logic 认领 引用
6
作者 Wei LI Yuefei SUI Yuhui WANG 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第3期215-216,共2页
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.Typ... 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. 展开更多
关键词 default propositional Nonmonotonic
暂未订购 下载PDF
Polynomial algorithm of limited propositional deduction 认领 引用 被引量：1
7
作者 史忠植 廖乐健 《Science China(Technological Sciences)》 CAS 1999年第4期418-424,共7页
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 ... 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. 展开更多
关键词 limited propositional deduction polynomial algorithm problem of propositional satisfiability constraint satisfaction problem
暂未订购 下载PDF
A Practical Propositional Knowledge Base Revision Algorithm 认领 引用
8
作者 陶雪红 孙伟 马绍汉 《Journal of Computer Science & Technology》 SCIE EI 1997年第2期154-159,共6页
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... 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. 展开更多
关键词 Propositional knowledge base revision satisfiability problem
暂未订购 下载PDF
Single-cell deoxyribonucleic acid typing for forensic mixtures and trace evidence:Opportunities,validation requirements,and reporting limits 认领 引用
9
作者 Kyriacos Evangelou Paraskevi Angeli +1 位作者 Andreas Polydorou Thalia Petropoulou 《World Journal of Biological Chemistry》 2026年第2期1-9,共9页
Forensic deoxyribonucleic acid(DNA)interpretation is limited less by genotyping technology than by the biochemical and inferential effects of mixed,low-template,and environmentally complex traces.Single-cell and singl... Forensic deoxyribonucleic acid(DNA)interpretation is limited less by genotyping technology than by the biochemical and inferential effects of mixed,low-template,and environmentally complex traces.Single-cell and single-molecule strategies,including the United Kingdom Research and Innovation-funded single-cell and single-molecule analysis for DNA identification(SCAnDi)program,aim to preserve cellular resolution.They allow investigators to isolate and type individual cells or defined small-cell pools before heterogeneous evidence is converted into a bulk lysate.In selected validation settings,this approach has yielded near-complete diploid short tandem repeat(STR)profiles from small pools,credible genotype sets tightly concentrated on the true genotype across high-order mixtures,and improved access to donor-specific profiles from sexual assault and other complex samples.However,these studies also show important limits.Many operationally successful“single-cell”workflows are,in practice,single-cell-plusconsensus or few-cell workflows.Stochastic effects remain intrinsic,and cell capture itself becomes a probabilistic sampling step.This opinion review explicitly adopts an evaluative stance:It synthesizes recent validation studies and guidance documents to identify the performance thresholds and reporting boundaries that should be met before targeted forensic deployment of SCAnDilike workflows.We argue that casework entry should require measured cell-recovery probabilities,phenotypemisclassification rates,locus-and cell-type-specific dropout and stutter models,quantified contamination and drop-in rates,validated minimum cell counts for consensus generation,and explicit database-upload criteria.It should also require strict separation between sub-source reporting and activity-level propositions.If those conditions are met,single-cell typing can complement,rather than replace,bulk STR analysis and probabilistic genotyping in a narrow but important set of high-value forensic scenarios. 展开更多
关键词 Forensic genetics Single-cell genomics DNA mixtures Laser capture microdissection Digital cell sorting Whole-genome amplification Short tandem repeats Activity-level propositions DNA transfer
暂未订购 下载PDF
Discrete and Topological Correspondence Theory for Modal MeetImplication Logic and Modal MeetSemilattice Logic in Filter Semantics 认领 引用
10
作者 Fei Liang Zhiguang Zhao 《逻辑学研究》 CSSCI 2025年第3期25-66,共42页
In the present paper,we give a systematic study of the discrete correspondence the-ory and topological correspondence theory of modal meet-implication logic and moda1 meet-semilattice logic,in the semantics provided i... In the present paper,we give a systematic study of the discrete correspondence the-ory and topological correspondence theory of modal meet-implication logic and moda1 meet-semilattice logic,in the semantics provided in[21].The special features of the present paper include the following three points:the first one is that the semantic structure used is based on a semilattice rather than an ordinary partial order,the second one is that the propositional vari-ables are interpreted as filters rather than upsets,and the nominals,which are the“first-order counterparts of propositional variables,are interpreted as principal filters rather than principal upsets;the third one is that in topological correspondence theory,the collection of admissi-ble valuations is not closed under taking disjunction,which makes the proof of the topological Ackermann 1emma different from existing settings. 展开更多
关键词 topological correspondence theory semilattice modal meet implication logic modal meet semilattice logic discrete correspondence theory semantic structure propositional variables filter semantics
暂未订购 下载PDF
Kripke’s Intrinsic Truths in Boolean Systems 认领 引用
11
作者 Ming Hsiung Zhaolong Yuan 《逻辑学研究》 CSSCI 2025年第6期19-42,共24页
In Kripke’s theory of truth,the largest intrinsic fixed point—like the least fixed point—is of special theoretical interest among all fixed points.However,for intrinsic yet ungrounded sentences(i.e.,those belonging... In Kripke’s theory of truth,the largest intrinsic fixed point—like the least fixed point—is of special theoretical interest among all fixed points.However,for intrinsic yet ungrounded sentences(i.e.,those belonging to the largest intrinsic fixed points but not to the least fixed point),only sporadic examples have been provided so far,and a universal criterion for deciding such sentences remains unknown.This paper aims to establish a general criterion for determining intrinsic truth in Boolean systems of self-referential sentences under Kleene’s strong valuation scheme.To achieve this,we first present a known result about the definability of three-valued functions within Kleene’s strong logic.Then,by reducing the problem of determining the fixed points to a calculation problem in propositional logic,we demonstrate a truth-functional characteristic for the intrinsic truths in Boolean systems.We thus find an effective method for constructing intrinsic truths in a first-order language for Peano arithmetic.We also discuss the applicability of our findings to Kleene’s weak valuation scheme. 展开更多
关键词 determining intrinsic truth Kripkes theory truth fixed points intrinsic ungrounded sentences iethose Kleenes strong valuation scheme intrinsic truths propositional logic largest intrinsic fixed point
暂未订购 下载PDF
A Practical Study of Teaching Propositions in High School Mathematics Based on the TPACK Framework 认领 引用
12
作者 Jianping Luo 《Journal of Contemporary Educational Research》 2025年第7期56-64,共9页
Under the background of information technology in education,there is insufficient integration of technological knowledge,pedagogical knowledge,and subject content knowledge in the teaching of propositions in high scho... Under the background of information technology in education,there is insufficient integration of technological knowledge,pedagogical knowledge,and subject content knowledge in the teaching of propositions in high school mathematics.Teachers mostly equate information technology with multimedia presentations,and students often memorize formulas mechanically,which leads to difficulties in the application of complex propositions.In this study,we take“the cosine formula of the difference between two angles”as an example.Based on the TPACK framework,we use contextual teaching and geometric drawing board demonstration to integrate subject content,pedagogical knowledge,and technological knowledge in teaching design and practice.It is found that by dynamically displaying the derivation process of the formula and guiding students to explore independently,it can help them understand the logic of the formula and improve their application ability.This study provides a paradigm for teaching propositions in high school mathematics and suggests that the TPACK framework can facilitate knowledge integration and cultivate students’mathematical literacy such as problem posing and creative inquiry,which is of great significance for teaching practice. 展开更多
关键词 TPACK High school mathematics Propositional teaching Teaching practice
暂未订购 下载PDF
PSL的有界模型检验 认领 引用 被引量：2
13
作者 虞蕾 赵宗涛 《电子学报》 EI CAS 北大核心 2009年第3期614-621,共8页
基于SAT的有界模型检验被视为是基于OBDD的符号化模型检验技术的重要补充,是并行反应式系统的一种有效验证方法.然而,直至现在,有界模型检验已验证的属性逻辑还十分有限.PSL是一种用于描述并行系统的属性规约语言(IEEE-1850),包括线性... 基于SAT的有界模型检验被视为是基于OBDD的符号化模型检验技术的重要补充,是并行反应式系统的一种有效验证方法.然而,直至现在,有界模型检验已验证的属性逻辑还十分有限.PSL是一种用于描述并行系统的属性规约语言(IEEE-1850),包括线性时序逻辑FL和分支时序逻辑OBE两部分.通过模型检验可验证系统的PSL属性,本文提出了PSL的有界模型检验方法及其算法框架.首先,定义PSL逻辑的有界语义,而后,将有界语义进一步简化为SAT,分别将PSL性质规约公式和系统M的状态迁移关系转换为SAT命题公式,最后验证上述两个SAT命题公式合取式的可满足性,这样就将时序逻辑PSL的存在模型检验转化为一个命题公式的可满足性问题,并用一个队列控制电路实例具体解释算法执行过程. 展开更多
关键词 PSL(property specification language) 有界模型检验(bounded model checking,BMC) SAT(propositional satisfiability) OBDD(ordered binary decision diagram)
暂未订购 下载PDF
J-Resolution Fields of Generalized Literals of L14P(X) 认领 引用
14
作者 李晓冰 徐扬 《Journal of Southwest Jiaotong University(English Edition)》 2007年第4期357-360,共4页
To deal with automated reasoning of linguistic truth-valued lattice-valued logic system, a lattice implication algebra with 14 elements, L14, was defined, and the J-resolution fields of constants, propositional variab... To deal with automated reasoning of linguistic truth-valued lattice-valued logic system, a lattice implication algebra with 14 elements, L14, was defined, and the J-resolution fields of constants, propositional variables and some generalized literals of L14P（X）, which is a lattice-valued propositional logic system with truth-values in L14, were discussed. There are 4 filters in L14. For any constant a not belonging to J, a and g （generalized literal of L14P（X）） form a J-resolution pair. For a propositional variable x, if x belongs to J and g does not belong to J, then x and g form a J-resolution pair. 展开更多
关键词 Constant Propositional variable Generalized literal Filter Resolution field
暂未订购 下载PDF
The Theory of Membership Degree of Γ-Conclusion in Several n-Valued Logic Systems 认领 引用 被引量：3
15
作者 Jiancheng Zhang 《American Journal of Operations Research》 2012年第2期147-152,共6页
Based on the analysis of the properties of Γ-conclusion by means of deduction theorems, completeness theorems and the theory of truth degree of formulas, the present papers introduces the concept of the membership de... Based on the analysis of the properties of Γ-conclusion by means of deduction theorems, completeness theorems and the theory of truth degree of formulas, the present papers introduces the concept of the membership degree of formulas A is a consequence of Γ (or Γ-conclusion) in Lukasiewicz n-valued propositional logic systems, Godel n-valued propositional logic system and the R0 n-valued propositional logic systems. The condition and related calculations of formulas A being Γ-conclusion were discussed by extent method. At the same time, some properties of membership degree of formulas A is a Γ-conclusion were given. We provide its algorithm of the membership degree of formulas A is a Γ-conclusion by the constructions of theory root. 展开更多
关键词 N-Valued Propositional Logic Γ-Conclusion Theory Root Membership Degree
暂未订购 下载PDF
The Design and Analysis of Helium Turbine Expander Impeller with a Given All-Over-Controlled Vortex Distribution 认领 引用
16
作者 刘晓东 付豹 庄明 《Plasma Science and Technology》 SCIE EI CAS CSCD 2014年第3期288-293,共6页
To make the large-scale helium cryogenic system of fusion device EAST （experimen- tal advanced super-conducting tokamak） run stably, as the core part, the helium turbine expander must meet the requirement of refrige... To make the large-scale helium cryogenic system of fusion device EAST （experimen- tal advanced super-conducting tokamak） run stably, as the core part, the helium turbine expander must meet the requirement of refrigeration capacity. However, previous designs were based on one dimension flow to determine the average fluid parameters and geometric parameters of impeller cross-sections, so that it could not describe real physical processes in the internal flow of the tur- bine expander. Therefore, based on the inverse proposition of streamline curvature method in the context of quasi-three-dimensional flows, the all-over-controlled vortex concept was adopted to design the impeller under specified condition. The wrap angle of the impeller blade and the whole flow distribution on the meridian plane were obtained; meanwhile the performance of the designed impeller was analyzed. Thus a new design method is proposed here for the inverse proposition of the helium turbine expander impeller. 展开更多
关键词 helium turbine expander streamline curvature method meridian plane all-over-controlled vortex inverse proposition
暂未订购 下载PDF
在变乱交织的世界中坚决维护国家安全 认领 引用
17
作者 唐永胜 《Contemporary International Relations》 2023年第2期17-22,共6页
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... 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. 展开更多
关键词 proposition deepening outside
暂未订购 下载PDF
Singular Propositions, Truth and Reference 认领 引用
18
作者 何朝安 《逻辑学研究》 CSSCI 2015年第3期88-100,共13页
单称命题观念的可理解性和合法性是当代弗雷格主义语义学与罗素主义语义学争论的焦点问题。在模态结构下,单称命题观念与一系列强有力的基本假设相冲突。普兰廷加等人发展了一个专门针对单称命题的标准论证,试图通过归谬论证来证明单称... 单称命题观念的可理解性和合法性是当代弗雷格主义语义学与罗素主义语义学争论的焦点问题。在模态结构下,单称命题观念与一系列强有力的基本假设相冲突。普兰廷加等人发展了一个专门针对单称命题的标准论证,试图通过归谬论证来证明单称命题观念是不融贯的。面对之于单称命题理论的这一挑战,一种颇具潜力的应对策略是区分两种真理观念,即命题在"世界里"为真与命题在"世界上"为真的区分。此策略试图表明,承诺单称命题"在世界上为真"并不导致与基本假设相冲突。本文在此专门考察这一策略的可行性。基于真理问题与指称问题的内在联系,即语句指称(真值)是语词指称的函项,我们力图证明,两种真理观念的区分实际上可还原为著名的顽固指称固定性和持续指称固定性的区分。而后一区分可以相当严格地在卡普兰的二维语义学框架下得到说明。此框架的实质基础是指称纳入的概念。文章基于对空名语义学的相关分析,通过借鉴埃文斯的描述性名称构造方式,构造了一种独特的绝对空名。最后,以此为基础,我们试图表明卡普兰框架下的指称"纳入"概念难以贯彻到底,继而,以之为基础来为单称命题观念提供辩护的策略也难以维系。 展开更多
关键词 单称命题 proposition 归谬论证 truth 可理解性 notion 弗雷格 names
暂未订购 下载PDF
Cordial Volterra Integral Equations with Vanishing Delays 认领 引用
19
作者 Hongjiu Wang Zhanwen Yang Melusi Khumalo 《Journal of Applied Mathematics and Physics》 2017年第2期294-302,共9页
Cordial Volterra integral equations (CVIEs) from some applications models associated with a noncompact cordial Volterra integral operator are discussed in the recent years. A lot of real problems are effected by a del... Cordial Volterra integral equations (CVIEs) from some applications models associated with a noncompact cordial Volterra integral operator are discussed in the recent years. A lot of real problems are effected by a delayed history information. In this paper we investigate some properties of cordial Volterra integral operators influenced by a vanishing delay. It is shown that to replicate all eigenfunctions , or , the vanishing delay must be a proportional delay. For such a linear delay, the spectrum, eigenvalues and eigenfunctions of the operators and the existence, uniqueness and solution spaces of solutions are presented. For a nonlinear vanishing delay, we show a necessary and sufficient condition such that the operator is compact, which also yields the existence and uniqueness of solutions to CVIEs with the vanishing delay. 展开更多
关键词 Cordial Volterra Integral Equations Vanishing Delay Propositional Delay Compactness Existence and Uniqueness
暂未订购 下载PDF
Translating Performance: Educating Translators at the Interface of Oralate/Literate Cultures 认领 引用
20
作者 Kobus Marais 《US-China Foreign Language》 2013年第9期706-715,共10页
This paper draws on the linguistic anthropology of Marcell Jousse （1886-1961） and complexity theory for a holistic conceptualisation of human interaction. It proposes the propositional geste as the means of human in... This paper draws on the linguistic anthropology of Marcell Jousse （1886-1961） and complexity theory for a holistic conceptualisation of human interaction. It proposes the propositional geste as the means of human interaction and then draws implications for the translation of oral style texts and for translator education. Grounding language practice in human interaction provides theoretical space to conceptualise various modes of interaction in a unified theory of language practice. It puts orality on a par with literacy. Translator education should base its curriculum on a view of translation, like the one propounded in this paper, which provides for all modes of human interaction. The particular modes of human interaction in Africa should be reflected in these curricula. 展开更多
关键词 translation education linguistic anthropology propositional geste orality language practice curriculum
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 5 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈