One of the most important benefits of using a theorem prover system is the absolute accuracy of the obtained result. However, solving mathematical problems often requires both deductive reasoning and algebraic computation. This issue is due to the fact that many real-life problems can be described with equations for which we cannot find easily symbolic (or closed-form) solutions and therefore we are not able to formalize them using the theorem prover. In other cases, some applications require well developed libraries and a deep knowledge of the theories to formalize simple expressions. A straightforward way to overcome these issues is the use of computer algebra systems or numerical approaches which are known to be the most efficient to...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
AbstractTheorema is a project that aims at supporting the entire process of mathematical theory expl...
International audienceWe present a new scheme to translate mathematical developments from HOL Light ...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
Contains fulltext : 35027.pdf (publisher's version ) (Open Access
. Computer algebra systems are extremely powerful and flexible, but often give results which require...
We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL L...
International audienceWe observe today a large diversity of proof systems. This diversity has the ne...
We present an algorithm for converting proofs from the OpenTheory interchange format, which can be t...
This thesis is about mechanically establishing the correctness of computer programs.\ua0In particula...
peer reviewedA shallow semantical embedding of free logic in classical higher-order logic i...
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities...
International audienceHigher Order Logic has been used in formal mathematics, software verification ...
AbstractThe standard OpenMath is an enabling technology for creating an integrated computer environm...
Metis is an automated theorem prover based on ordered paramodulation. It is widely employed in the i...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
AbstractTheorema is a project that aims at supporting the entire process of mathematical theory expl...
International audienceWe present a new scheme to translate mathematical developments from HOL Light ...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
Contains fulltext : 35027.pdf (publisher's version ) (Open Access
. Computer algebra systems are extremely powerful and flexible, but often give results which require...
We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL L...
International audienceWe observe today a large diversity of proof systems. This diversity has the ne...
We present an algorithm for converting proofs from the OpenTheory interchange format, which can be t...
This thesis is about mechanically establishing the correctness of computer programs.\ua0In particula...
peer reviewedA shallow semantical embedding of free logic in classical higher-order logic i...
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities...
International audienceHigher Order Logic has been used in formal mathematics, software verification ...
AbstractThe standard OpenMath is an enabling technology for creating an integrated computer environm...
Metis is an automated theorem prover based on ordered paramodulation. It is widely employed in the i...
As verification efforts using interactive theorem proving grow, we are in need of certified algorith...
AbstractTheorema is a project that aims at supporting the entire process of mathematical theory expl...
International audienceWe present a new scheme to translate mathematical developments from HOL Light ...