程序謂詞 的英文怎麼說
中文拼音 [chéngxùwèicí]
程序謂詞
英文
program predicate- 程 : 名詞1 (規章; 法式) rule; regulation 2 (進度; 程序) order; procedure 3 (路途; 一段路) journe...
- 謂 : Ⅰ動詞1. (說) say 2. (稱呼; 叫做) call; name Ⅱ名詞1. (意義) meaning; sense 2. (姓氏) a surname
- 詞 : 名詞1 (說話或詩歌、文章、戲劇中的語句) speech; statement; lines of play 2 (一種韻文形式 起於唐...
- 程序 : 1 (進行次序) order; procedure; course; sequence; schedule; ground rule; routing process 2 [自動...
-
The algorithm of this paper is applicable to two - dimension factorizing program, which includes one idb predicate
本文的演算法適合於包含一個idb謂詞的二維可分解程序。Abstract : for a precise dataflow analysis within the framework of the computation function model, the logical relationship of branch conditions is represented as the coverage relationship of regions. in this paper, the authors discuss how to represent, compute and propagate the region, region of the conditional reference. meanwhile, the methods of resolving the nondeterminism caused by conditional branch statements are also presented in order to get more precise dataflow information
文摘:用計算函數模型進行精確的數據流分析,條件謂詞之間的邏輯關系被轉化為空間區域之間的覆蓋關系.該文討論在各種常見的程序構造下如何表示、計算和傳遞區域、區域,並在數據流分析過程中,利用區域、區域之間的覆蓋關系消除條件分支語句帶來的不確定性,以得到更精確的數據流信息However, in search of the relevant data, the cost of generating additional tuples produced by logic program to which magic transformation is applied increases with the arity of idb ( intensional database ) predicates increasing
但是隨著遞歸idb ( intensionaldatabase )謂詞的項的個數增大,經魔集轉換的邏輯程序為尋找與查詢相關數據而產生附加元組的開銷也會增大。This program creates truth tables from boolean expressions. i believe that it ' s very useful for computer science students who learning boolean algebra and predicate logic ( like my self )
這個程序從布爾表達式中創建真實的表格。我相信對于學習布爾代數學和謂詞邏輯的計算機科學學生(像我自己這樣的)來說它是非常有用的。Do you have any idea how many people in the realms of so - called metaphysics are hypocrites or have no idea what they are talking about - spouting forth cliches of the 1990 grid programs
有多少人進入所謂的形而上學領域是偽君子,或者對他們所說的毫無主意,不知你對此有何看法? ?像水落管系統般地向外陳詞濫調1990年的柵格程序?The event handler that performs the actions of the verb
執行謂詞的操作的事件處理程序。Specifies the verb list that matches the verb list of the handler to remove
指定與要移除的處理程序的謂詞列表相匹配的謂詞列表。Windows forms has no shell integration and does not respond to shell verbs
Windows窗體則沒有外殼程序集成,並且不對外殼程序謂詞作出響應。The program being checked is also converted to a finite state machine, created by abstracting away all the details except the atomic predicates observed in the program
被檢查的程序也被轉換為一個有限狀態機器,通過摘掉所有細節、只保留程序中被觀測的原子謂詞。The property to be checked is described as a finite state machine that transitions on atomic predicates, properties that can be identified by cursory look at the program
所要檢查的特性被描述為一個有限狀態機器,即原子謂詞上的轉變,這樣粗略地查看程序就能識別出這些特性。Interface, which is the managed interface used to add handlers for menu commands and to define verbs. the
介面,此介面是用於為菜單命令添加處理程序和定義謂詞的託管介面。Jon edvardsson et al pointed out that the technique developed by neelam gllpta et al is neither complete nor terminationai for w on which all of the predicate functions with respect to the input variables are linear, and suggested using linear programming and linear ( mixed ) integer programming methods instead
Jonedvardsson等人指出,對于謂詞函數均為輸入變量的線性函數的程序路徑, neelamgupta等人提出的求解方法是不完備的和非終止的,並建議採用線性規劃、線性(混合)整數規劃方法。This thesis gives a model language and a moderately complete formal description which can be used to prove the properties of static and dynamic data dependencies, and defines the notions in the iterative relaxation method formally. the program theories about the iterative relaxation method and its improvement are investigated, whose results include : the generalization of the predicate slices proposed by neelam gupta et al to path - wise static slices, and the proofs of the soundness of the construction algorithm of path - wise static slices and the soundness of the improvement
本文給出一種模型語言;給出一個比較完整的形式化描述,該描述可用於證明與靜態、動態數據依賴關系有關的程序性質;給出迭代鬆弛法中各概念的形式化定義;深入研究迭代鬆弛法及其改進后的方法的程序理論,其結果包括:將neelamgupta等人提出的謂詞片推廣為路徑靜態切片,證明路徑靜態切片構造演算法的正確性,證明改進后的方法與原方法所生成的線性約束系統相同。The central work of this paper is as follow : ( 1 ) a new factorizing optimization algorithm which reduce the arity of idb predicates by factorizing the logic program is presented magic transformation is applied to subprogram. moreover the decomposed subprogram can be implemented in parallel. therefore, it improves the efficiency of magic transformation
本文的主要工作如下: ( 1 )提出一種新的分解優化演算法,它通過對邏輯程序進行分解,減少idb謂詞項的個數,再對分解后的各個子程序進行魔集轉換,而且分解后的各個魔程序可并行執行,從而提高魔集轉換的執行效率。A path - wise test data generation framework is proposed in this thesis, whose fundamental algorithm is the improved method. this framework adopts a constraint solver using linear programming and linear ( mixed ) integer programming methods for w on which all of the predicate functions with respect to the input variables are linear. for w on which there is nonlinear function ( s ) with respect to the input variables
該框架以改進后的迭代鬆弛法為核心演算法,對于謂詞函數均為輸入變量的線性函數的程序路徑,採用基於線性規劃、線性(混合)整數規劃的約束求解器;對于謂詞函數中含有輸入變量的非線性函數的程序路徑,採用線性規劃、線性(混合)整數規劃和最小二乘解法相結合的約束求解器。分享友人