代码搜索:proposition

找到约 45 项符合「proposition」的源代码

代码结果 45
www.eeworm.com/read/234859/14095338

cpp ass2.cpp

#include "ass2.h" #include "math.h" #include #include //typedef struct _GrammarProposition //{ // struct _GrammarProposition* lChild; // struct _GrammarProposition* rChild
www.eeworm.com/read/359303/10156484

tex definition.tex

\chapter{定理型声明示例} \section{自动编号的声明} \begin{definition} % \aaa \end{definition}% \begin{proposition} % \aaa \end{proposition}% \begin{theorem}% \aaa \end{theorem}% \begin{example}% \aaa \
www.eeworm.com/read/234859/14095341

h ass2.h

#include #include #include #include using namespace std; #define OPERNUM 5 #define UNOPER 1 #define BINOPER 2 #define MIN_OPER_LENGTH 1 #define MAX_O
www.eeworm.com/read/205036/15328955

m m2_identities_doc_future.m

%% Identities and relationships of tensors % There are many mathematical relationships, identities, and % connections among tensors. These identities are presented here and % show the versatility
www.eeworm.com/read/251851/12315051

m evaluate.m

function f = evaluate(node) % Evaluate the ACTL formula stored in the pare tree. % % Syntax: % "f = evaluate(node)" % % Description: % Given a parse tree "node" for an ACTL formula, compute the
www.eeworm.com/read/217557/14958651

m evaluate.m

function f = evaluate(node) % Evaluate the ACTL formula stored in the pare tree. % % Syntax: % "f = evaluate(node)" % % Description: % Given a parse tree "node" for an ACTL formula, com
www.eeworm.com/read/191613/8426061

cpp pr0106.cpp

// Programming with C++ by John R. Hubbard // Copyright McGraw-Hill, 2000 // Problem 1.6 on page 10 // Printing the Gettysburg Address #include using namespace std; int main()
www.eeworm.com/read/202486/15381657

cpp pr0106.cpp

// Programming with C++ by John R. Hubbard // Copyright McGraw-Hill, 2000 // Problem 1.6 on page 10 // Printing the Gettysburg Address #include using namespace std; int main()
www.eeworm.com/read/251851/12315032

m build_ap.m

function atomic_propositions = build_ap(ap_build_list) % Build regions corresponding to the atomic propositions specified in the % input list. % % Syntax: % "build_ap(ap_build_list)" % % Descript
www.eeworm.com/read/147693/12538651

pl fig15_9.pl

% Figure 15.9 An interpreter for rules with certainties. % Rule interpreter with certainties % certainty( Proposition, Certainty) certainty( P, Cert) :- given( P, Cert). certainty( C