Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
The mathematics of belief functions can be handled with the use of the matrix notation. This representation helps greatly the user thanks to its notational simplicity and its effi...
We present a search engine for mathematical formulae. The MathWebSearch system harvests the web for content representations (currently MathML and OpenMath) of formulae and indexes ...
We give a brief account of some de Finetti style representation theorems for probability functions satisfying Spectrum Exchangeability in Polyadic Inductive Logic, together with ap...