11,152 research outputs found
Proof by analogy in mural
One of the most important advantages of using a formal method of developing software is that one can prove that development steps are correct with respect to their specification.
Conducting proofs by hand, however,can be time consuming to the extent that designers have to judge whether a proof of a particular obligation is worth conducting.
Even if hand proofs are worth conducting, how do we know that they are correct?
One approach to overcoming this problem is to use an automatic theorem proving system to develop and check our proofs. However, in order to enable present day
theorem provers to check proofs, one has to conduct
them in much more detail than hand proofs. Carrying out more detailed proofs is of course more time consuming.
This paper describes the use of proof by analogy in an attempt to reduce the time spent on proofs.
We develop and implement a proof follower based on analogy and present two examples to illustrate its
characteristics. One example illustrates the successful use of the proof follower. The other example illustrates that the follower's failure can provide a hint that enables the user to complete a proof
Planning and Proof Planning
. 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 introduced by Bundy in [2] still lives in its childhood. This means that the development of proof planning needs maturing impulses and the natural questions arise What can proof planning learn from its Big Brother planning?' and What are the specific characteristics of the proof planning domain that determine the answer?'. In turn for planning, the analysis of approaches points to a need of mature techniques for practical planning. Drummond [8], e.g., analyzed approaches with the conclusion that the success of Nonlin, SIPE, and O-Plan in practical planning can be attributed to hierarchical action expansion, the explicit representation of a plan's causal structure, and a very simple form of propo..
Hipster: Integrating Theory Exploration in a Proof Assistant
This paper describes Hipster, a system integrating theory exploration with
the proof assistant Isabelle/HOL. Theory exploration is a technique for
automatically discovering new interesting lemmas in a given theory development.
Hipster can be used in two main modes. The first is exploratory mode, used for
automatically generating basic lemmas about a given set of datatypes and
functions in a new theory development. The second is proof mode, used in a
particular proof attempt, trying to discover the missing lemmas which would
allow the current goal to be proved. Hipster's proof mode complements and
boosts existing proof automation techniques that rely on automatically
selecting existing lemmas, by inventing new lemmas that need induction to be
proved. We show example uses of both modes
Proof-Pattern Recognition and Lemma Discovery in ACL2
We present a novel technique for combining statistical machine learning for
proof-pattern recognition with symbolic methods for lemma discovery. The
resulting tool, ACL2(ml), gathers proof statistics and uses statistical
pattern-recognition to pre-processes data from libraries, and then suggests
auxiliary lemmas in new proofs by analogy with already seen examples. This
paper presents the implementation of ACL2(ml) alongside theoretical
descriptions of the proof-pattern recognition and lemma discovery methods
involved in it
Mining State-Based Models from Proof Corpora
Interactive theorem provers have been used extensively to reason about
various software/hardware systems and mathematical theorems. The key challenge
when using an interactive prover is finding a suitable sequence of proof steps
that will lead to a successful proof requires a significant amount of human
intervention. This paper presents an automated technique that takes as input
examples of successful proofs and infers an Extended Finite State Machine as
output. This can in turn be used to generate proofs of new conjectures. Our
preliminary experiments show that the inferred models are generally accurate
(contain few false-positive sequences) and that representing existing proofs in
such a way can be very useful when guiding new ones.Comment: To Appear at Conferences on Intelligent Computer Mathematics 201
A Geometric Approach to Combinatorial Fixed-Point Theorems
We develop a geometric framework that unifies several different combinatorial
fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing
them to be different geometric manifestations of the same topological
phenomena. In doing so, we obtain (1) new Tucker-like and Sperner-like
fixed-point theorems involving an exponential-sized label set; (2) a
generalization of Fan's parity proof of Tucker's Lemma to a much broader class
of label sets; and (3) direct proofs of several Sperner-like lemmas from
Tucker's lemma via explicit geometric embeddings, without the need for
topological fixed-point theorems. Our work naturally suggests several
interesting open questions for future research.Comment: 10 pages; an extended abstract appeared at Eurocomb 201
- …