Towards Fine-Grained Proof Planning with Critical Agents
暂无分享,去创建一个
Agent Based Command Suggestion Mechanism In order to support users within large proofs, most interactive theorem provers have some limited capability to suggest parameters of choosen commands or even commands themselves. However, those mechanisms generally have the shortcomings that they use in exible sequential computation strategies (i.e., although most parameters in uence the suggestions of each other they are suggested in some order such that parameters choosen earlier in uence those required later, but not vice versa) and do not su ciently use available system resources by computing suggestions inbetween single interaction steps.
[1] Volker Sorge,et al. Critical Agents Supporting Interactive Theorem Proving , 1999, EPIA.
[2] Wilfried Sieg,et al. Normal Natural Deduction Proofs (in classical logic) , 1998, Stud Logica.
[3] Volker Sorge,et al. A Blackboard Architecture for Guiding Interactive Proofs , 1998, AIMSA.
[4] Alan Bundy,et al. The Use of Explicit Plans to Guide Inductive Proofs , 1988, CADE.