Titlebook: Automated Deduction - CADE-11; 11th International C Deepak Kapur Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Automat

NO610

書目名稱Automated Deduction - CADE-11影響因子(影響力)




書目名稱Automated Deduction - CADE-11影響因子(影響力)學(xué)科排名




書目名稱Automated Deduction - CADE-11網(wǎng)絡(luò)公開度




書目名稱Automated Deduction - CADE-11網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Automated Deduction - CADE-11被引頻次




書目名稱Automated Deduction - CADE-11被引頻次學(xué)科排名




書目名稱Automated Deduction - CADE-11年度引用




書目名稱Automated Deduction - CADE-11年度引用學(xué)科排名




書目名稱Automated Deduction - CADE-11讀者反饋




書目名稱Automated Deduction - CADE-11讀者反饋學(xué)科排名

殺死

Proving geometry statements of constructive type,lass C. We prove a mathematical theorem that in the irreducible case, the non-degenerate conditions generated by our method are . for a geometry statement in Class C to be valid in .. About 400 among 600 theorems proved by our computer program are in Class C.

MODE

faultfinder

Unification in the union of disjoint equational theories: Combining decision procedures,mpute finite complete sets of unifiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms which just decide solvability of unification problems without computing unifiers. In this paper we describe a combination algorithm for decision proc

Cabinet

浮雕

憲法沒有

安撫

松果

十字架

Polynomial interpretations and the complexity of algorithms,xity this imposes. The main result of this paper is that a polynomial interpretation termination proof of a rewrite system . which computes a number theoretic function implies a polynomial bound on that function‘s rate of growth.