AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. For the foreseeable future, there will be theorems which cannot be proved completely automatically, so the ability to allow human intervention is desirable; for this intervention to be productive the problem of orienting the user in the proof attempt must be overcome. There are many semi-automatic theorem provers: we call our style of theorem provingco-operative, in that the skills of both human and automaton are used each to their best advantage, and used together may find a proof where other methods fail. The co-operative nature of thebarnacleinterface is made possible by the proof planning technique underpinningclam. Our claim is that proof ...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--foun...
We propose a mechanism for semi-automated proving of theorems, using a tactic for the Coq proof assi...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
Research on automated and interactive theorem proving aims at the mechanization of logical reasoning...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--found...
AbstractClassical automated theorem proving of today is based on ingenious search techniques to find...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Centre for Intelligent Systems and their ApplicationsCoinduction is a proof rule which is the dual o...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
The e ective use of automated theorem provers is frequently augmented by embedding these systems int...
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
AbstractIn this paper, we present the results of an ongoing effort in building user interfaces for p...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--foun...
We propose a mechanism for semi-automated proving of theorems, using a tactic for the Coq proof assi...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...
AbstractWe describebarnacle: a co-operative interface to theclaminductive theorem proving system. Fo...
AbstractKnowledge-based proof planning is a new paradigm in automated theorem proving (ATP) which sw...
Abstract. In this paper we propose how proof planning systems can be extended by an automated learni...
Research on automated and interactive theorem proving aims at the mechanization of logical reasoning...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--found...
AbstractClassical automated theorem proving of today is based on ingenious search techniques to find...
Proof planning is an alternative methodology to classical automated theorem proving based on exhausi...
Centre for Intelligent Systems and their ApplicationsCoinduction is a proof rule which is the dual o...
Abstract. Proof planning is an approach to the automation of theorem proving in which search is cond...
The e ective use of automated theorem provers is frequently augmented by embedding these systems int...
Centre for Intelligent Systems and their ApplicationsIn this thesis we investigate the applicability...
AbstractIn this paper, we present the results of an ongoing effort in building user interfaces for p...
Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--foun...
We propose a mechanism for semi-automated proving of theorems, using a tactic for the Coq proof assi...
AbstractProof planning is a technique for theorem proving which replaces the ultra-efficient but bli...