Kerber, Manfred - School of Computer Science, University of Birmingham

• doi:10.1006/ jsco.2000.0458 Available online at
• THE UNIVERSITY OF BIRMINGHAM
• How to Prove Higher Order Theorems in First Order Logic
• -mkrp: A Proof Development Environment
• THE UNIVERSITY OF BIRMINGHAM
• THE UNIVERSITY OF BIRMINGHAM
• Automatic Learning of Proof Methods in Proof Planning
• http://www.cs.bham.ac.uk/ A Resolution Calculus for
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• WoLLIC 2004 Preliminary Version Living with Paradoxes
• An Approach of Formalizing Mathematics
• On Truth, Knowledge, Strings, and Paradoxes Manfred Kerber
• http://www.cs.bham.ac.uk/ On Knowledge, Strings, and
• Manfred Kerber The University of Birmingham
• Living with Paradoxes Manfred Kerber
• FACHBEREICH GERMANY WWW
• Reuse of Proofs by Meta-Methods
• Combining Proofs of Higher-Order and First-Order Automated Theorem Provers
• FACHBEREICH GERMANY WWW
• What makes a problem hard for XCS? Tim Kovacs and Manfred Kerber
• http://www.cs.bham.ac.uk/ Common Syntax of the
• Automatic Learning in Proof Planning Mateja Jamnik 1;2 and Manfred Kerber 2 and Martin Pollet 3;2
• FACHBEREICH GERMANY WWW
• THE UNIVERSITY OF BIRMINGHAM
• FACHBEREICH GERMANY WWW
• A Tough Nut for Mathematical Knowledge Management
• On the Translation of Higher-Order Problems into
• Prisoners of Reason Manfred Kerber
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• FACHBEREICH GERMANY WWW
• The Adaptation of Proof Methods by Reformulation Xiaorong Huang \Lambda Manfred Kerber y Lassaad Cheikhrouhou \Lambda
• On the Design of Mathematical Concepts Manfred Kerber i Martin Pollet i;ii
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• Crash in Program and Logic Viviana Bono
• Requirements for Building up Large Mathematical Knowledge Bases
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• THE UNIVERSITY OF BIRMINGHAM
• THE UNIVERSITY OF BIRMINGHAM
• http://www.cs.bham.ac.uk/ A Call for Standardising Input
• On the Representation of Mathematical Concepts and
• The Adaptation of Proof Methods by Reformulation Xiaorong Huang
• Automatic Learning of Proof Methods in Proof Planning
• KEIM: A Toolkit for Automated Deduction
• The -mkrp Proof Development Environment
• FACHBEREICH GERMANY WWW
• INTEGRATING COMPUTER ALGEBRA INTO PROOF PLANNING
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• http://www.cs.bham.ac.uk/ The Adaption of Proof Methods
• MANFRED KERBER PROOF PLANNING: A PRACTICAL APPROACH TO
• FACHBEREICH GERMANY WWW
• THE UNIVERSITY OF BIRMINGHAM
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• THE UNIVERSITY OF BIRMINGHAM
• Reformulating Resolution Problems by Tactics
• doi:10.1006/jsco.2000.0458 Available online at http://www.idealibrary.com on
• Adaptation of Declaratively Represented Methods in Proof Planning
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• A Tough Nut for Mathematical Knowledge Management
• THE UNIVERSITY OF BIRMINGHAM
• Can a Higher-Order and a First-Order Theorem Prover Cooperate?
• Intuitive and Formal Representations: The Case of Matrices
• High classi cation accuracy does not imply e ective genetic search
• Automatic Learning in Proof Planning Mateja Jamnik and Manfred Kerber and Martin Pollet
• On the Design of Mathematical Concepts Manfred Kerberi
• A Lost Proof Christoph Benzmuller1
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• THE UNIVERSITY OF BIRMINGHAM
• THE UNIVERSITY OF BIRMINGHAM
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• THE UNIVERSITY OF BIRMINGHAM
• Using Exemplary Knowledge for Justi ed Analogical Reasoning
• Adaptation of Declaratively Represented Methods
• Sound and Complete Translations from Sorted
• Representing the Diagonalization Methods
• Formalizing Mathematics with Dependent Sorts
• How to Use a First-Order Model Generator for Adjusting
• Guaranteeing Correctness through the Communication of
• A Test for Evaluating the Practical Usefulness of
• Reasoning with Assertions and Manfred Kerber Erica Melis
• A Mechanization of Strong Kleene Logic for Partial
• Reasoning with Assertions And Manfred Kerber, Erica Melis, and Jorg
• Methods The Basic Units for Planning and Verifying Proofs
• How to Prove Higher Order Theorems in First Order Logic
• Some Aspects of Analogy in Mathematical Reasoning
• Analogical Reasoning with Typical Examples
• A declarative language for formulating methods
• Sortenlogiken und ihre Automatisierung
• http://www.cs.bham.ac.uk/ Partiality without the Cost
• Towards Learning New Methods in Proof Planning Mateja Jamnik, Manfred Kerber, and Christoph Benzmuller
• What Makes a Problem Hard for XCS? Tim Kovacs and Manfred Kerber
• What Makes a Problem Hard for XCS? ? Tim Kovacs and Manfred Kerber
• Resource Guided Concurrent Deduction Christoph Benzm uller ? ; Mateja Jamnik ? ; Manfred Kerber ? ; Volker Sorge y
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• THE UNIVERSITY OF BIRMINGHAM
• Semantic Selection for Resolution in Clause Graphs
• Tactics for the Improvement of Problem Formulation
• The Semantic Clause Graph Procedure Manfred Kerber Seungyeob Choi
• MODEL-GUIDED PROOF PLANNING Seungyeob Choi and Manfred Kerber
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• On the Representation of Mathematical Knowledge in
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• A Lost Proof Christoph Benzmuller 1 and Manfred Kerber 2
• http://www.cs.bham.ac.uk/ Proving Ground Completeness
• The Semantic Clause Graph Procedure Manfred Kerber Seungyeob Choi
• Planning Mathematical Proofs with Methods
• http://www.cs.bham.ac.uk/ Mechanising Partiality without
• http://www.cs.bham.ac.uk/ Towards an Open System for
• Resource Guided Concurrent Deduction C. Benzmuller ? ; M. Jamnik ? ; M. Kerber ? ; V. Sorge y
• On the Representation of Mathematical Concepts and
• A ThreeValued Hoare Calculus Viviana Bono
• THE UNIVERSITY OF BIRMINGHAM
• THE UNIVERSITY OF BIRMINGHAM
• LocModGen Model Generation by Local Search Manfred Kerber
• Resource Guided Concurrent Deduction Christoph Benzmuller ; Mateja Jamnik ; Manfred Kerber ; Volker Sorge
• On the Design of Mathematical Concepts Manfred Kerberi
• Mehrwertige Logiken in der KI Manfred Kerber
• THE UNIVERSITY OF BIRMINGHAM
• Requirements for Building up Large Mathematical Knowledge Bases
• THE UNIVERSITY OF BIRMINGHAM
• Some dimensions of problem complexity for XCS Tim Kovacs and Manfred Kerber
• \Omega mega: Towards a Mathematical Assistant Christoph Benzmuller, Lassaad Cheikhrouhou, Detlef Fehrer, Armin Fiedler,
• Analogical Reasoning with a Hybrid Knowledge Base
• Adaptation of Declaratively Represented Methods in Proof Planning
• A Challenge for Mechanized Deduction Christoph Benzmuller 1 and Manfred Kerber 2
• On the Design of Mathematical Concepts Manfred Kerber 1 and Martin Pollet 2;1
• FACHBEREICH GERMANY WWW
• A ThreeValued Approach to Overcome Paradoxes in Syntactic Theory
• INTEGRATING COMPUTER ALGEBRA INTO PROOF PLANNING
• Adapting Methods to Novel Tasks in Proof Planning
• Living with Paradoxes Manfred Kerber
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• FACHBEREICH GERMANY WWW
• Intuitive and Formal Representations: The Case of Matrices
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• mega: Towards a Mathematical Assistant Christoph Benzmuller, Lassaad Cheikhrouhou, Detlef Fehrer, Armin Fiedler,
• On Truth, Knowledge, Strings, and Paradoxes Manfred Kerber
• A Three-Valued Approach to Overcome Paradoxes in Syntactic Theory
• Deduktionssysteme Manfred Kerber and Christoph Weidenbach
• A Proof Development Environment
• Why is the Lucas-Penrose Argument Invalid? Manfred Kerber
• FACHBEREICH GERMANY WWW
• http://www.cs.bham.ac.uk/ Integrating Computer Algebra
• FACHBEREICH GERMANY WWW
• LocModGen { Model Generation by Local Search Manfred Kerber
• THE UNIVERSITY OF BIRMINGHAM
• On the Design of Mathematical Concepts ? Manfred Kerber i and Martin Pollet i;ii
• FACHBEREICH GERMANY WWW
• 9 999 System Description Mateja Jamnik 1;2 , Manfred Kerber 2 , and Martin Pollet 3;2
• MANFRED KERBER PROOF PLANNING: A PRACTICAL APPROACH TO
• THE UNIVERSITY OF BIRMINGHAM
• A Mechanization of Strong Kleene Logic for Partial
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• WoLLIC 2004 Preliminary Version Living with Paradoxes
• THE UNIVERSITY OF BIRMINGHAM
• Beweisentwicklungsumgebung\Omega\Gamma Mkrp \Lambda Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis
• FACHBEREICH GERMANY WWW
• http://www.cs.bham.ac.uk/ Mechanising Partiality
• FACHBEREICH GERMANY WWW
• Useful Properties of a Frame-Based Representation of
• http://www.cs.bham.ac.uk/ Using Tactics to Reformulate
• High classi cation accuracy does not imply e ective genetic search
• Why is the Lucas-Penrose Argument Invalid? Manfred Kerber
• http://www.cs.bham.ac.uk/ Two Kinds of NonMonotonic
• THE UNIVERSITY OF BIRMINGHAM
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• Experiments with an Agent-oriented Reasoning System
• Towards Learning New Methods in Proof Planning
• Prisoners of Reason Manfred Kerber
• FACHBEREICH GERMANY WWW
• Adapting the Diagonalization Method by Reformulations
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience
• From MKRP to MEGA Manfred Kerber
• FACHBEREICH GERMANY WWW
• THE UNIVERSITY OF BIRMINGHAM
• THE UNIVERSITY OF BIRMINGHAM
• http://www.cs.bham.ac.uk/ A Tableau Calculus for Partial
• Planning Mathematical Proofs with Methods
• FACHBEREICH GERMANY WWW
• FACHBEREICH GERMANY WWW
• http://www.cs.bham.ac.uk/ Generalisation in Mathematical
• THE UNIVERSITY OF BIRMINGHAM
• Combining Proofs of Higher-Order and First-Order Automated Theorem Provers
• THEUNIVERSITYOFBIRMINGHAM SchoolofComputerScience