分析了《工程制图》课程试卷命题的特点,提出了《工程制图》试卷机设计要求,分析了试卷机开发模式,选择AutoCAD/VBA(Visual Basic for Application)进行试卷机的开发,所开发的试卷机经试用可满足各类工程制图试卷在选题、修改、排版等...分析了《工程制图》课程试卷命题的特点,提出了《工程制图》试卷机设计要求,分析了试卷机开发模式,选择AutoCAD/VBA(Visual Basic for Application)进行试卷机的开发,所开发的试卷机经试用可满足各类工程制图试卷在选题、修改、排版等方面的出卷要求;具有出卷效率高、试题分散性好、简单易用与题库可自主升级的特点.展开更多
The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known: Re...The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known: Resolution with restricted number of variables in disjuncts, resolution over Linear Equations, Cutting planes, etc. For Classical, Intuitionistic and Minimal (Johansson's) propositional logics, the authors introduce the family of resolution systems with full substitution rule (SRC, SRI and SRM) and with e-restricted substitution rule (SeRC, SeRf and SeRM), where the number of substituted formula connectives is bounded by . The authors show that for each of mentioned logic the SR-type system (in tree form) is polynomially equivalent to Frege systems by size, but for every ~' 〉 0, Se+lR-type has exponential speed-up over the SeR-type (in tree form).展开更多
文摘分析了《工程制图》课程试卷命题的特点,提出了《工程制图》试卷机设计要求,分析了试卷机开发模式,选择AutoCAD/VBA(Visual Basic for Application)进行试卷机的开发,所开发的试卷机经试用可满足各类工程制图试卷在选题、修改、排版等方面的出卷要求;具有出卷效率高、试题分散性好、简单易用与题库可自主升级的特点.
文摘The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known: Resolution with restricted number of variables in disjuncts, resolution over Linear Equations, Cutting planes, etc. For Classical, Intuitionistic and Minimal (Johansson's) propositional logics, the authors introduce the family of resolution systems with full substitution rule (SRC, SRI and SRM) and with e-restricted substitution rule (SeRC, SeRf and SeRM), where the number of substituted formula connectives is bounded by . The authors show that for each of mentioned logic the SR-type system (in tree form) is polynomially equivalent to Frege systems by size, but for every ~' 〉 0, Se+lR-type has exponential speed-up over the SeR-type (in tree form).