Author:
Flower Jean,Masthoff Judith,Stapleton Gem
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Dahn, B.I., Wolf, A.: Natural language presentation and combination of automatically generated proofs. In: Proc. Frontiers of Combining Systems, Muenchen, Germany, pp. 175–192 (1996)
2. Dechter, R., Pearl, J.: Generalized best-first search strategies and the optimality of A ∗ . Journal of the Association for Computing Machinery 32(3), 505–536 (1985)
3. Fish, A., Flower, J., Howse, J.: A Reading algorithm for constraint diagrams. In: Proc. IEEE Symposium on Visual Languages and Formal Methods, New Zealand (2003)
4. Flower, J., Stapleton, G.: Automated Theorem Proving with Spider Diagrams. In: Proc. Computing: The Australasian Theory Symposium, Elsevier science, Amsterdam (2004)
5. Goller, C.: Learning search-control heuristics for automated deduction systems with folding architecture networks. In: Proc. European Symposium on Artificial Neural Networks. D-Facto publications (April 1999)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献