命題邏輯 的英文怎麼說

中文拼音 [mìngtíluó]
命題邏輯 英文
logic of proposition
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 邏 : Ⅰ動1. （巡察） patrol 2. [書面語] （遮攔） blockⅡ名詞1. （巡察） patrol 2. [書面語] （山溪的邊緣） edge
  • 輯 : Ⅰ動詞（編輯; 輯錄） collect; compile; edit Ⅱ名詞（整套書籍、資料的各個部分） part; volume; division
  • 命題 : 1 （出題目） assign a topic; set a question 2 [邏輯學] （表達判斷的句子） proposition; statement;...
  • 邏輯 : logic
  1. Metric structures on boolean algebras and an application to propositional logic

    代數上的度量結構及其在命題邏輯中的應用
  2. Based on paper [ 1 ] and [ 2 ], this paper gives two generating algorithms to calculate and output the special conjunctive normal forms and special disjunctive forms of given propositional formulas automatically and formally

    摘要在文[ 1 ]和文[ 2 ]的基礎上，給出了命題邏輯中任一命題公式的主析取範式和主合取範式的自動生成演算法，並實現了多個命題公式主範式的同時形式化輸出。
  3. Part three the study of lattice - valued modal first - order logic system and its resolution principle in this part, we introduced quantifiers and predicate into lmp ( x ), put up lattice - valued modal first - order logic system lmf ( x ), and gave its semantic interpretation and syntax structure, proved soundness theorem and consistence theorem. moreover, in order to judge the satisfiability of formula, defined skolem standard type and h - interpretation. based on these work, made a primary discussion of a - resolution principle based on lmf ( x )

    第三部分：關于格值模態一階邏輯系統及其歸結原理的研究第n頁西南交通大學博士研究生學位論文這一部分主要是在格值模態命題邏輯系統lmp隊）中引進量詞和謂詞，建立格值模態一階邏輯系統lmf （廣並給出其語又解釋和語法結構，證明了系統的可靠性和協調性；另外，為了判斷公式的可滿足性，定義了格值模態一階公式的skolem標準型和體解釋；在此基礎上，對基於系統lmf （ ）的a一歸結原理進行了初步探討
  4. Using these algorithms, we can use computer mechanically to list truth value table of a group of propositional formulae, determine that if a given propositional formula is a tautology, a contradiction, or if the formula is satisfiable

    給出了命題邏輯中任一命題公式的真值表的生成演算法與命題公式類型的判定演算法，實現了利用計算機對有限多個命題公式的真值表的直接計算和輸出，以及對一個命題公式是重言式、矛盾式或可滿足式的機械判定。
  5. In this thesis, reasning based medel and resolution principle are deeply studied, and using netal network partly driplement automated reasoning

    本文在對命題邏輯系統的模型推理和歸結原理研究的基礎上，嘗試利用神經網路部分實現自動推理。
  6. Based on the production of other researchers such as professor xu yang and professor qin keyun, this paper discusses the structure and properties of lattice implication algebra, tautologies in some lattice - valued systems, automated reasoning methods, lattice - valued prepositional logic system

    本文的工作是在徐揚教授、秦克雲教授等研究成果的基礎上，對格蘊涵代數的性質、結構、格值命題邏輯系統中的重言式、自動推理方法、格值命題邏輯系統等進行了一些研究。
  7. About theorem, the paper introduces the syntax of ideal, also the first time uses concept of honest ideal to define secrecy goal of protocol and utilizes honest ideal logic to specify secrecy property. at the same time, this paper corrects one not so perfect lemma proving in a literature written by f " abrega, herzog and guttman

    在理論上，本文引入了理想的語義，並首次使用了理想的概念對安全協議的秘密性進行嚴格的定義，同時使用理想的命題邏輯公式表示安全協議的秘密性；另外，本文修正了f ' abrega 、 herzog和guttman三人文獻中的一個引理的證明，原有的證明是不完善的。
  8. Truth degree of intuitionistic fuzzy propositional logic formula

    直覺模糊命題邏輯公式的真度
  9. Part two the study of lattice - valued tense propositional logic system and its resolution method the main work of this part is to introduce four tense operators e ( ever ), f ( will ), h ( ever always ) and g ( will always ) into lp ( x ), put up lattice - valued tense propositional logic system ltp ( x ) which takes time axis as language circumstance, gave detailed semantic interpretation and syntax structure, and discussed some properties of it, then proved soundness theorem and consistence theorem. furthermore, studied ( a, t ) - resolution principle which is related to time, gave some rules of computing tense resolvent, and put forward the method of tense resolution

    第二部分：關于格值時態命題邏輯系統及其歸結方法的研究此部分的主要工作是在格值命題邏輯系統lp （ x ）中引進時態運算元e （曾經） 、 f （將會）及其對偶運算元h （曾經總是） 、 g （將會總是） ，提出了以時軸為語境的格值時態命題邏輯系統ltp （ x ） ，並給出其具體的語義解釋和語法結構，並討論了它的一些性質，證明了該系統的可靠性和協調性。
  10. Study of flexible logic based on universal logic

    基於泛邏輯學的柔性命題邏輯研究
  11. Secondly, in the theory of gl with the four rules of producing such as generator rule, generating radix rule, rule of basis space changing, developing order rule, gpl can produce all kinds of basic operation model with other logic such as classical propositional logic, three - value logic, fuzzy logic and broad sense fuzzy logic. finally, it proved that a material logic can be produce by gpl. and it shows the universality gpl can contain most logic

    眾所周知，邏輯學家正是利用這些定義證明了該邏輯的全部推理規則，建立起了整個命題邏輯體系；然後我們直接利用命題泛邏輯學的生成規則，通過對廣義相關系數h的不同取值也同樣生成了這些運算模型，也就是說直接生成了這個命題邏輯；這個生成過程還揭示了各種運算模型的物理意義和使用條件，也就是說揭示了各種命題邏輯的物理意義和使用條件。
  12. Propositional logic - based method of liquid rocket engine fault diagnosis

    液體火箭發動機故障診斷的命題邏輯方法
  13. Most current researches of data mining are limited in the proposition logic framework, in which there exist disadvantages of weak representation power and not being able to utilize naturally background knowledge

    當前的數據挖掘研究主要在命題邏輯的框架內，存在描述能力弱和不便於利用背景知識的局限性。
  14. ( 3 ) it is well known that the determinant problem in classic proposition logic is a np complete problem, and the first order logic is a half determinant one. so both the analysis of computing complexity and the realization of it are the most important fields

    （ 3 ）眾所周知，經典命題邏輯中的判定問題是np完全問題，而一階邏輯是半可判定問題，關于非經典邏輯特別是非單調邏輯的計算復雜性分析和演算法實現是一個重要的研究領域。
  15. Based on lattice - valued propositional logic system lp ( x ) and lattice - valued first - order logic system lf ( x ), the author studied semantic and syntax properties of generalized lattice - valued modal logic system, and probed into a - resolution principle. the specific contents are as follows : part one the study of lattice - valued modal propositional logic system and its resolution method in this part, we introduced modal operators n ( necessary ) and p ( possible ) into lattice - valued propositional logic system lp ( x ), set up a new lattice - valued modal propositional logic system lmp ( x ), studied its semantic properties and syntax structure, proved the soundness and consistence of this system. based on these work, discussed a - resolution principle of lattice - valued modal propositional logic system lmp ( x ), gave out the rules of computing a - direct resolvent and a - self resolvent, and proposed detailed resolution method

    本文在格值命題邏輯系統lp （ x ）和格值一階邏輯系統lf （ x ）的基礎上，討論了廣義格值模態邏輯系統的語義及語法性質，並對其-歸結原理做了初步探討，主要在下述三個方面取得了研究成果：第一部分：關于格值模態命題邏輯系統及其歸結方法的研究在此部分，把模態運算元n （必然）和p （可能）引入格值命題邏輯系統lp （ x ） ，建立了新的格值模態命題邏輯系統lmp （ x ） ，並研究了它的語義刻畫及語法結構，證明了在此語義解釋和語法框架下的系統仍是-可靠的和協調的；在此基礎上，進一步研究了基於格值模態命題邏輯系統lmp （ x ）的-歸結原理，給出了計算-直接歸結式和-自歸結式的規則，並總結出具體的歸結方法。
  16. Several years ago, professor ju shi - er advanced that reasoning could proceed based on an open world, proposing an assumption of a 3 - valued propositional logic based on an open world

    鞠實兒教授在研究開放世界的邏輯過程中給出了一個開放世界的命題邏輯。
  17. Generating sat instances from first - order formulas

    由一階邏輯公式得到命題邏輯可滿足性問題實例
  18. Huang zhuo ( computer software & theory ) directed by zhang jian the algorithms and tools to solve first - order logic model searching ( folms ) problem with finite domain size are studied in this thesis. the satisfiability ( sat ) problem in the prepositional logic and folms are classic problems of computer science, which are important in theory and have wide applications in a lot of real - world problems

    命題邏輯可滿足性（ sat ）問題和有限論域一階邏輯模型搜索（ folms ）問題是計算機理論科學中的經典問題，不僅在理論上有著重要的地位，而且在許多實際問題中得到了廣泛的應用。
  19. Theory of truth degrees in lukasiewicz n - valued propositional logic

    值命題邏輯中命題的真度理論
  20. Theory of truth degree in lukasiewicz 3 - valued propositional loggic

    三值命題邏輯中命題的真度理論
分享友人
分享到 Line

分享到臉書