. Mechanised reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two different tasks, proving and calculating. Even more importantly, proof and computation are often interwoven and not easily separable. In this contribution we advocate an integration of computer algebra into mechanised reasoning systems at the proof plan level. This approach allows to view the computer algebra algorithms as methods, that is, declarative representations of the problem solving knowledge specific to a certain mathematical domain. Automation can be achieved in many cases by searching for a hierarchic proof plan at the methodlevel using suitable domain-spec...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
AbstractWe report on a case study on combining proof planning with computer algebra systems. We cons...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
Mechanised reasoning systems and computer algebra systems have apparentlydifferent objectives. Their...
Abstract. We discuss a pragmatic approach tointegrate computer algebra into proof planning. It is ba...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL L...
Abstract. The use of computer algebra is usually considered beneficial for mechanised reasoning in m...
In this paper we present a framework for automated learning within mathematical reasoning systems. ...
Abstract. The use of computer algebra is usually considered beneficial for mechanised reasoning in m...
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities...
Abstract. We are building a system that helps us mix proof with com-putation. On the one hand, theor...
AbstractClassical automated theorem proving of today is based on ingenious search techniques to find...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
. The paper addresses comprehensible proof presentation for teaching and learning that can be provid...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
AbstractWe report on a case study on combining proof planning with computer algebra systems. We cons...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...
Mechanised reasoning systems and computer algebra systems have apparentlydifferent objectives. Their...
Abstract. We discuss a pragmatic approach tointegrate computer algebra into proof planning. It is ba...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL L...
Abstract. The use of computer algebra is usually considered beneficial for mechanised reasoning in m...
In this paper we present a framework for automated learning within mathematical reasoning systems. ...
Abstract. The use of computer algebra is usually considered beneficial for mechanised reasoning in m...
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities...
Abstract. We are building a system that helps us mix proof with com-putation. On the one hand, theor...
AbstractClassical automated theorem proving of today is based on ingenious search techniques to find...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
. The paper addresses comprehensible proof presentation for teaching and learning that can be provid...
This paper presents a generic architecture for proof planning systems in terms of an interaction bet...
AbstractWe report on a case study on combining proof planning with computer algebra systems. We cons...
In this paper we describe an environment for reasoning about the reals which combines the rigour of ...