Results 231 to 240 of about 349,803 (277)
Some of the next articles are maybe not open access.
International Journal of Theoretical Physics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2001
We review the fundamental resolution-based methods for first-order theorem proving and present them in a uniform framework. We show that these calculi can be viewed as specializations of non-clausal resolution with simplification. Simplification techniques are justified with the help of a rather general notion of redundancy for inferences.
Leo Bachmair +3 more
openaire +3 more sources
We review the fundamental resolution-based methods for first-order theorem proving and present them in a uniform framework. We show that these calculi can be viewed as specializations of non-clausal resolution with simplification. Simplification techniques are justified with the help of a rather general notion of redundancy for inferences.
Leo Bachmair +3 more
openaire +3 more sources
Proceedings of the annual conference on - ACM'73, 1973
The results of Notice 72-H2 of the NAMS of June 1972, issue 138, were proven using the Theorem Proving Program of Allen & Luckham1. Proofs of the results stated by Cowen, Frisz & Grenadir in their notice Some New Axiomatizations in Group Theory, a Preliminary Report and an extension of their results, namely, a new single axiom characterizing abelian ...
openaire +1 more source
The results of Notice 72-H2 of the NAMS of June 1972, issue 138, were proven using the Theorem Proving Program of Allen & Luckham1. Proofs of the results stated by Cowen, Frisz & Grenadir in their notice Some New Axiomatizations in Group Theory, a Preliminary Report and an extension of their results, namely, a new single axiom characterizing abelian ...
openaire +1 more source
2001
In modern algebraic methods for automated geometry theorem proving, Wu’s characteristic set method (Wu, 1978, 1994; Chou, 1988) and the Grobner basis method (Buchberger, Collins and Kutzler, 1988; Kutzler and Stifter, 1986; Kapur, 1986) are two basic ones.
openaire +2 more sources
In modern algebraic methods for automated geometry theorem proving, Wu’s characteristic set method (Wu, 1978, 1994; Chou, 1988) and the Grobner basis method (Buchberger, Collins and Kutzler, 1988; Kutzler and Stifter, 1986; Kapur, 1986) are two basic ones.
openaire +2 more sources
2011
The semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
openaire +1 more source
The semi-decidability of provability leads to the design of proof search algorithms. This chapter first introduces the sequent calculus, gives a proof of the cut elimination theorem and discusses proof search in the cut free sequent calculus.
openaire +1 more source
1996
In Chapter 4 we discussed ways of improving the efficiency of resolution based deductive process by minimizing the length of resolvents and by simplifying the termination test. In this chapter we focus on theorem proving strategies — the speed-up techniques for controlling and directing the deductive process of an automated reasoning system.
openaire +1 more source
In Chapter 4 we discussed ways of improving the efficiency of resolution based deductive process by minimizing the length of resolvents and by simplifying the termination test. In this chapter we focus on theorem proving strategies — the speed-up techniques for controlling and directing the deductive process of an automated reasoning system.
openaire +1 more source
2001
This chapter first surveys the early development of mechanical theorem proving in geometry. GTP was initially viewed as an artificial intelligence problem that many believed would be easily tackled by machines. However, the initial optimism soon vanished as various difficulties associated with the domain emerged and no significant results could be ...
openaire +1 more source
This chapter first surveys the early development of mechanical theorem proving in geometry. GTP was initially viewed as an artificial intelligence problem that many believed would be easily tackled by machines. However, the initial optimism soon vanished as various difficulties associated with the domain emerged and no significant results could be ...
openaire +1 more source
2004
We discuss the benefits of complete unsound inference procedures for efficient methods of disproof. We give a framework for converting a sound and complete saturation-based inference procedure into successive unsound and complete procedures, that serve as successive approximations to the theory.
openaire +1 more source
We discuss the benefits of complete unsound inference procedures for efficient methods of disproof. We give a framework for converting a sound and complete saturation-based inference procedure into successive unsound and complete procedures, that serve as successive approximations to the theory.
openaire +1 more source
Proving Theorems by Pattern Recognition - II
Bell System Technical Journal, 1960Certain preliminary results on doing mathematics by machines (“mechanical mathematics”) were reported in an earlier paper [20]. The writer suggested developing inferential analysis as a branch of applied logic and as a sister discipline of numerical analysis. This analogy rests on the basic distinction of pure existence proofs, elegant procedures which
openaire +2 more sources
Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT
Foundations and Trends in Machine Learning, 2021exaly