Automatic mathematical solution assessment checks the equivalence of mathematical expressions in the user answer and standard solution. It is a challenging problem as the semantics of mathematical expressions are highly symbolic and equivalent mathematical expressions can be expressed in different forms. In this paper, we propose an effective Probabilistic Equivalence Verification (PEV) approach for automatic mathematical solution assessment. The proposed PEV approach is a randomized method based on the probabilistic numerical equivalence testing of two mathematical expressions. It can avoid false negative errors completely while guaranteeing a small probability of false positive errors to occur. The performance results have shown that the ...
Abstract. Proving the equivalence of programs has several important applications, including algorith...
Arithmetic expressions are the fundamental building blocks of hardware and software systems. An impo...
Web-based testing is an effective approach for self-assessment and intelligent tutoring in an e-lear...
Automatic mathematical solution assessment checks the equivalence of mathematical expressions in the...
In this research an assessment engine that emulates human marking processes in checking the correctn...
International audienceEquivalence checking is a formal verification approach that consists in provin...
In connection with the spread of computer algebra systems (and algebraic calculators), the natural q...
We propose a new randomised algorithm for deciding language equivalence for probabilistic automata. ...
[[abstract]]Exact approaches to combinational equivalence checking, such as automatic test pattern g...
In this paper, we propose a new randomised algorithm for deciding language equivalence for probabili...
Abstract In many analyses based on estimating the parameters of probability distribution functions,...
Probabilistic Compositional Models:solution of an equivalence problemProbabilistic Compositional Mod...
This paper describes an approximate approach for combinational equivalence checking. We propose an a...
Deciding equivalence of probabilistic automata is a key problem for establishing various behavioural...
Current needs in the verification of systems evolve from boolean properties to finer quantitative pr...
Abstract. Proving the equivalence of programs has several important applications, including algorith...
Arithmetic expressions are the fundamental building blocks of hardware and software systems. An impo...
Web-based testing is an effective approach for self-assessment and intelligent tutoring in an e-lear...
Automatic mathematical solution assessment checks the equivalence of mathematical expressions in the...
In this research an assessment engine that emulates human marking processes in checking the correctn...
International audienceEquivalence checking is a formal verification approach that consists in provin...
In connection with the spread of computer algebra systems (and algebraic calculators), the natural q...
We propose a new randomised algorithm for deciding language equivalence for probabilistic automata. ...
[[abstract]]Exact approaches to combinational equivalence checking, such as automatic test pattern g...
In this paper, we propose a new randomised algorithm for deciding language equivalence for probabili...
Abstract In many analyses based on estimating the parameters of probability distribution functions,...
Probabilistic Compositional Models:solution of an equivalence problemProbabilistic Compositional Mod...
This paper describes an approximate approach for combinational equivalence checking. We propose an a...
Deciding equivalence of probabilistic automata is a key problem for establishing various behavioural...
Current needs in the verification of systems evolve from boolean properties to finer quantitative pr...
Abstract. Proving the equivalence of programs has several important applications, including algorith...
Arithmetic expressions are the fundamental building blocks of hardware and software systems. An impo...
Web-based testing is an effective approach for self-assessment and intelligent tutoring in an e-lear...