Cooperating reasoning processes: More than just the sum of their parts

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2-11

  Bundy, Alan ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COGNITIVE MODELLING; FORMATION AND EVOLUTIONS; HARDWARE AND SOFTWARE; IMPERATIVE PROGRAMS; LOGICAL REPRESENTATIONS; MATHEMATICAL INDUCTION; MATHEMATICAL REASONING; REASONING UNDER UNCERTAINTY;

ARTIFICIAL INTELLIGENCE; HARDWARE; REPAIR; VERIFICATION;

MATHEMATICAL TRANSFORMATIONS;

EID: 84880865248     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (57)

1. Christoph Benzmüller and Volker Sorge. OANTS - an open approach at combining interactive and automated theorem proving. In M. Kerber and M. Kohlhase, editors, 8th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus-2000), pages 81-97, St. Andrews, UK, 6-7 August 2001. AK Peters, New York, NY, USA.
2. A. Bundy and B. Welham. Using meta-level inference for selective application of multiple rewrite rules in algebraic manipulation. Artificial Intelligence, 16(2):189-212, 1981.
3. Also available from Edinburgh as DAI Research Paper 121.
4. A. Bundy, L. Byrd, G. Luger, C. Mellish, R. Milne, and M. Palmer. Solving mechanics problems using meta-level inference. In B. G. Buchanan, editor, Proceedings of IJCAI-79, pages 1017-1027. International Joint Conference on Artificial Intelligence, 1979.
5. Reprinted in 'Expert Systems in the microelectronic age' ed. Michie, D., pp. 50-64, Edinburgh University Press, 1979.
6. Also available from Edinburgh as DAI Research Paper No. 112.
7. A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303-324, 1991.
8. Earlier version available from Edinburgh as DAI Research Paper No 413.
9. A. Bundy, D. Basin, D. Hutter, and A. Ireland. Rippling: Meta-level Guidance for Mathematical Reasoning, volume 56 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2005.
10. A. Bundy, J. Gow, J. Fleuriot, and L. Dixon. Constructing induction rules for deductive synthesis proofs. In S. Allen, J. Crossley, K.K. Lau, and I Poernomo, editors, Proceedings of the ETAPS-05 Workshop on Constructive Logic for Automated Software Engineering (CLASE-05), Edinburgh, pages 4-18. LFCS University of Edinburgh, 2005. Invited talk.
11. A. Bundy, F. McNeill, and C. Walton. On repairing reasoning reversals via representational refinements. In Proceedings of the 19th International FLAIRS Conference, pages 3-12. AAAI Press, 2006. Invited talk.
12. Alan Bundy. Discovery and reasoning in mathematics. In A. Joshi, editor, Proceedings of IJCAI-85, pages 1221-1230. International Joint Conference on Artificial Intelligence, 1985.
13. Also available from Edinburgh as DAI Research Paper No. 266.
14. A. Bundy. The use of explicit plans to guide inductive proofs. In R. Lusk and R. Overbeek, editors, 9th International Conference on Automated Deduction, pages 111-120. Springer-Verlag, 1988.
15. Longer version available from Edinburgh as DAI Research Paper No. 349.
16. Alan Bundy. A science of reasoning. In J.- L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 178-198. MIT Press, 1991.
17. Also available from Edinburgh as DAI Research Paper 445.
18. Alan Bundy. The automation of proof by mathematical induction. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, Volume 1. Elsevier, 2001.
19. Claudio Castellini and Alan Smaill. Proof planning for first-order temporal logic. In Robert Nieuwenhuis, editor, Automated Deduction - CADE-20, volume 3632 of Lecture Notes in Computer Science, pages 235-249. Springer, 2005.
20. S. Colton and A. Pease. The TM system for repairing non-theorems. Electronic Notes in Theoretical Computer Science, 125(3), 2005. Elsevier.
21. S Colton, A Bundy, and T Walsh. HR: Automatic concept formation in puremathematics. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pages 786-791, 1999.
22. S. Colton, A. Meier, V. Sorge, and R. McCasland. Automatic generation of classification theorems for finite algebras". In Proceedings of the International Joint Conference on Automated Reasoning, 2004.
23. S Colton. Automated Theory Formation in Pure Mathematics. Springer-Verlag, 2002.
24. R. V. Desimone. Explanation-Based Learning of Proof Plans. In Y. Kodratoff and A. Hutchinson, editors, Machine and Human Learning. Kogan Page, 1989.
25. Also available as DAI Research Paper 304.
26. Previous version in proceedings of EWSL-86.
27. H. Duncan, A. Bundy, J. Levine, A. Storkey, and M. Pollet. The use of data-mining for the automatic formation of tactics. In Workshop on Computer- Supported Mathematical Theory Development. IJCAR-04, 2004.
28. J. Gow. The Dynamic Creation of Induction Rules Using Proof Planning. PhD thesis, School of Informatics, University of Edinburgh, 2004.
29. A. Ireland and A. Bundy. Productive use of failure in inductive proof. Journal of Automated Reasoning, 16(1-2):79-111, 1996.
30. Also available from Edinburgh as DAI Research Paper No 716.
31. A. Ireland and J. Stark. Proof planning for strategy development. Annals of Mathematics and Artificial Intelligence, 29(1-4):65-97, February 2001.
32. An earlier version is available as Research Memo RM/00/3, Dept. of Computing and Electrical Engineering, Heriot- Watt University.
33. A. Ireland, B.J. Ellis, A. Cook, R. Chapman, and J Barnes. An integrated approach to high integrity software verification. Journal of Automated Reasoning: Special Issue on Empirically Successful Automated Reasoning, 2006. To appear.
34. A. Ireland. The Use of Planning Critics in Mechanizing Inductive Proofs. In A. Voronkov, editor, International Conference on Logic Programming and Automated Reasoning - LPAR 92, St. Petersburg, Lecture Notes in Artificial Intelligence No. 624, pages 178-189. Springer-Verlag, 1992.
35. Also available from Edinburgh as DAI Research Paper 592.
36. M. Jamnik, M. Kerber, and M. Pollet. Automatic learning in proof planning. In F. van Harmelen, editor, Proceedings of 15th ECAI, pages 282-286. European Conference on Artificial Intelligence, IOS Press, 2002.
37. Predrag Janičić and Alan Bundy. A general setting for the flexible combining and augmenting decision procedures. Journal of Automated Reasoning, 28(3):257-305, 2002.
38. D. Kapur and M Subramaniam. Lemma discovery in automating induction. In M. A. McRobbie and J. K. Slaney, editors, 13th International Conference on Automated Deduction (CADE-13), pages 538-552. CADE, Springer, 1996.
39. I. Kraan, D. Basin, and A. Bundy. Middle-out reasoning for synthesis and induction. Journal of Automated Reasoning, 16(1-2):113-145, 1996.
40. Also available from Edinburgh as DAI Research Paper 729.
41. I. Lakatos. Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press, 1976.
42. W. McCune. The Otter user's guide. Technical Report ANL/90/9, Argonne National Laboratory, 1990.
43. W. McCune. A Davis-Putnam program and its application to finite first-order model search. Technical Report ANL/MCS-TM-194, Argonne National Labs, 1994.
44. Fiona McNeill. Dynamic Ontology Refinement. PhD thesis, School of Informatics, University of Edinburgh, 2005.
45. A. Meier and E. Melis. Failure reasoning in multiple-strategy proof planning. Electronic Notes in Theoretical Computer Science, 125:67-90, 2005. (Pubitemid 40325319)
46. E. Melis, A. Meier, and J. Siekmann. Proof planning with multiple strategies. Artificial Intelligence, 2006. To appear.
47. R. Monroy, A. Bundy, and A. Ireland. Proof Plans for the Correction of False Conjectures. In F. Pfenning, editor, 5th International Conference on Logic Programming and Automated Reasoning, LPAR'94, Lecture Notes in Artificial Intelligence, v. 822, pages 54-68, Kiev, Ukraine, 1994. Springer-Verlag.
48. Also available from Edinburgh as DAI Research Paper 681.
49. Raúl Monroy. Concept formation via proof planning failure. In R. Nieuwenhuis and A. Voronkov, editors, 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 2250 of Lecture Notes in Artificial Intelligence, pages 718-731. Springer-Verlag, 2001.
50. D. Robertson, Alan Bundy, R. Muetzelfeldt, M. Haggith, and M Uschold. Eco-Logic: Logic-Based Approaches to Ecological Modelling. MIT Press, 1991.
51. D. Ron, Y. Singer, and N. Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25, 1996.
52. J. Siekmann, C. Benzmüller, and S. Autexier. Computer supported mathematics with ΩMEGA. Journal of Applied Logic, Special Issue on Mathematics Assistance Systems, 2006. To appear.
53. B. Silver. Meta-level inference: Representing and Learning Control Information in Artificial Intelligence. North Holland, 1985. Revised version of the author's PhD thesis, Department of Artificial Intelligence, U. of Edinburgh, 1984.
54. V. Sorge, A. Meier, R. McCasland, and S. Colton. The automatic construction of isotopy invariants. In The proceedings of the International Joint Conference on Automated Reasoning., 2006.
55. L. Sterling, Alan Bundy, L. Byrd, R. O'Keefe, and B. Silver. Solving symbolic equations with PRESS. J. Symbolic Computation, 7:71-84, 1989.
56. Also available from Edinburgh as DAI Research Paper 171.
57. B.L. van der Waerden. How the Proof of Baudet's Conjecture Was Found, pages 251-260. Academic Press, 1971.