order logic 中文意思是什麼
order logic
解釋
階邏輯-
First - order logic provides ilp with a uniform and very expressive means of representation : the background knowledge and the examples, as well as the mined rules, can all be represented as formulas in a clausal language. so we can use naturally background knowledge in the mining process
一階邏輯為ilp提供了一致的和非常有表達力的表示手段:背景知識、例子以及挖掘到的知識都可表示為子句語言的公式,所以在挖掘過程中可非常自然地利用背景知識。 -
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一歸結原理進行了初步探討 -
The two - value weak model for first order logic with generalized quantifier
摘要:將帶廣義量詞 -
Proving several theorems in first order logic based on back - and - forth method
向前向後法證明一階邏輯的幾個定理 -
An algebraic proof of completeness theorem of first - order logic
一階邏輯完備性定理的代數證明 -
But besides being characterized by the extensional semantics, first - order logic can be characterized soundly and completely by such an intensional semantics that includes nothing but the property entities
相對于這一外延語義,一階邏輯還可為其中只含屬性實體而不含個體對象的內涵語義一致且完備地刻畫。 -
Then a simple e - dealing system is devised to show the thoughts of the protocol. in order to formalize and verify the protocol, bzl logic model is built, which based on first - order logic and introduces many - sorted, dynamic and non - monotony logic
為了形式化驗證數字現金的安全性,本文在經典一階邏輯的基礎上,吸取了多類邏輯、動態邏輯和非單調邏輯的思想,提出了bzl邏輯模型。 -
( 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完全問題,而一階邏輯是半可判定問題,關于非經典邏輯特別是非單調邏輯的計算復雜性分析和演算法實現是一個重要的研究領域。 -
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 )的-歸結原理,給出了計算-直接歸結式和-自歸結式的規則,並總結出具體的歸結方法。 -
First - order rule mining technique based on first - order logic is often called as inductive logic programming ( ilp )
基於一階邏輯的一階規則挖掘技術常被稱作歸納邏輯程序設計( ilp ) 。 -
An axiomatics for first - order logic
經典一階邏輯的希爾伯特型系統 -
Second - order logic
高階邏輯 -
First - order logic
二階邏輯 -
The aim we establish the logic frame bofl ( boolean operator fuzzy logic ) is to solve the innate limitation of the first - order logic
布爾運算元模糊邏輯(簡稱bofl )就是為了試圖解決一階邏輯的這些局限性而建立的邏輯框架。 -
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 )問題是計算機理論科學中的經典問題,不僅在理論上有著重要的地位,而且在許多實際問題中得到了廣泛的應用。 -
Firstly, a formal model of tpm is built using first - order logic language. then logic reasoning is made on the formal model
首先,在論文中用一階邏輯語言建立可信平臺模塊api的形式化模型,然後對建立的形式化模型進行邏輯推理分析。 -
Higher - order logic
非古典邏輯 -
The familiar semantics for first - order logic is extensional in that it is involved in individual objects rather than in any property entities
摘要熟知的一階邏輯語義因為只論及個體對象而不涉及屬性實體而被認為是外延的。 -
When sharing a quest, the order logic has changed to check whether or not the player has completed or is ineligible for the quest before checking whether their quest log is full
共享任務時將會先檢查玩家是否能接受此任務而不是他的任務日誌是否已經滿了。 -
The two - valued weak model of the first order logic with generalized quantifier q is generalized to be valued in complete weak complemented lattices. for finite linearly - ordered weak complemented lattice, the omitting type theorem is proved
將帶廣義量詞q的一階邏輯的二值弱模型推廣到取值于完備弱可補格上,對有限的線性序弱可補格證明了省略型定理。
分享友人