Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,382
Proof Planning
- PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON AI PLANNING SYSTEMS, (AIPS
, 1996
"... We describe proof planning, a technique for the global control of search in automatic theorem proving. A proof plan captures the common patterns of reasoning in a family of similar proofs and is used to guide the search for new proofs in this family. Proof plans are very similar to the plans cons ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
We describe proof planning, a technique for the global control of search in automatic theorem proving. A proof plan captures the common patterns of reasoning in a family of similar proofs and is used to guide the search for new proofs in this family. Proof plans are very similar to the plans
AI-Techniques in Proof Planning
- Artificial Intelligence
, 1998
"... . Proof planning is an application of Artificial Intelligence (AI)-planning in mathematical domains for theorem proving. The paper presents a knowledge-based proof planning approach that is implemented in the OMEGA proof planner. It evaluates control-rules in order to restrict the otherwise intracta ..."
Abstract
-
Cited by 87 (41 self)
- Add to MetaCart
. Proof planning is an application of Artificial Intelligence (AI)-planning in mathematical domains for theorem proving. The paper presents a knowledge-based proof planning approach that is implemented in the OMEGA proof planner. It evaluates control-rules in order to restrict the otherwise
Planning and Proof Planning
- ECAI-96 Workshop on Cross-Fertilization in Planning
, 1996
"... . The paper adresses proof planning as a specific AI planning. It describes some peculiarities of proof planning and discusses some possible cross-fertilization of planning and proof planning. 1 Introduction Planning is an established area of Artificial Intelligence (AI) whereas proof planning intr ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
. The paper adresses proof planning as a specific AI planning. It describes some peculiarities of proof planning and discusses some possible cross-fertilization of planning and proof planning. 1 Introduction Planning is an established area of Artificial Intelligence (AI) whereas proof planning
Experiments with Proof Plans for Induction
- Journal of Automated Reasoning
, 1992
"... The technique of proof plans, is explained. This technique is used to guide automatic inference in order to avoid a combinatorial explosion. Empirical research is described to test this technique in the domain of theorem proving by mathematical induction. Heuristics, adapted from the work of Boye ..."
Abstract
-
Cited by 105 (37 self)
- Add to MetaCart
The technique of proof plans, is explained. This technique is used to guide automatic inference in order to avoid a combinatorial explosion. Empirical research is described to test this technique in the domain of theorem proving by mathematical induction. Heuristics, adapted from the work
Proof Planning with Multiple Strategies
- In Proc. of the First International Conference on Computational Logic
, 2000
"... . Humans have different problem solving strategies at their disposal and they can flexibly employ several strategies when solving a complex problem, whereas previous theorem proving and planning systems typically employ a single strategy or a hard coded combination of a few strategies. We introd ..."
Abstract
-
Cited by 60 (37 self)
- Add to MetaCart
introduce multi-strategy proof planning that allows for combining a number of strategies and for switching flexibly between strategies in a proof planning process. Thereby proof planning becomes more robust since it does not necessarily fail if one problem solving mechanism fails. Rather it can reason
On the Comparison of Proof Planning Systems
"... We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three re ..."
Abstract
- Add to MetaCart
We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three
The Use of Proof Plans for Normalization
- Essays in Honor of Woody Bledsoe
, 1992
"... We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application of ..."
Abstract
-
Cited by 13 (4 self)
- Add to MetaCart
We propose using proof plans to implement expression normalizers in automatic theorem proving. We outline some general-purpose proof plans and show how these can be combined in various ways to yield some standard normalizers. We claim that using proof plans facilitates the flexible application
An Architecture for Proof Planning Systems
"... This paper presents a generic architecture for proof planning systems in terms of an interaction between a customisable proof module and search module. These refer to both global and local information contained in reasoning states. 1 ..."
Abstract
- Add to MetaCart
This paper presents a generic architecture for proof planning systems in terms of an interaction between a customisable proof module and search module. These refer to both global and local information contained in reasoning states. 1
Proof Planning Methods as Schemas
- J. Symbolic Computation
, 1999
"... A major problem in automated theorem proving is search control. Many expanded proofs are generally built from a large number of relatively low-level inference steps, with the results that searching the space of possible proofs at this level is very expensive. Proof planning is a technique by which c ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
A major problem in automated theorem proving is search control. Many expanded proofs are generally built from a large number of relatively low-level inference steps, with the results that searching the space of possible proofs at this level is very expensive. Proof planning is a technique by which
Automatic learning in proof planning
- ECAI-2002: European Conference on Artificial Intelligence
, 2002
"... Abstract. In this paper we present a framework for automatedlearning within mathematical reasoning systems. In particular, this framework enables proof planning systems to automatically learnnew proof methods from well chosen examples of proofs which use a similar reasoning pattern to prove related ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
Abstract. In this paper we present a framework for automatedlearning within mathematical reasoning systems. In particular, this framework enables proof planning systems to automatically learnnew proof methods from well chosen examples of proofs which use a similar reasoning pattern to prove related
Results 1 - 10
of
1,382
