Results 261 to 270 of about 523,591 (296)
Some of the next articles are maybe not open access.
Theorem Proving for Verification
2001The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.
openaire +2 more sources
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 +2 more sources
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 +2 more sources
Automated theorem proving in mathematics
Annals of Mathematics and Artificial Intelligence, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Theorem proving by combinatorial optimization
1993The inference problem in propositional logic realizes a strong connection between Artificial Intelligence and Operational Research. It is now well-known that this problem can be formulated as a constraint satisfaction problem (CSP), whose system has a generalized covering type (we recall that a CSP consists in proving the emptiness of a domain defined ...
Hachemi Bennaceur, Gérard Plateau
openaire +2 more sources
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 +3 more sources
Internal analogy in theorem proving
1996Internal analogy tries to reuse solutions of subproblems within the same problem solving process. In mathematical theorem proving several patterns are known where internal analogy suggests itself. Hence, we propose the use of internal analogy in automated theorem proving.
Erica Melis, Jon Whittle 0001
openaire +1 more source
Automated theorem proving methods
BIT, 1985A quick review of the basic ideas of four theorem proving methods is given: Robinson's resolution, Kowalski's connection graph, Prawitz' matrix reduction and the author's compactness method.
openaire +1 more source
Termination of theorem proving by reuse
1996We investigate the improvement of theorem provers by reusing previously computed proofs. We formulate our method for reusing proofs as an instance of the problem reduction paradigm and then develop a termination requirement for our reuse procedure.
Thomas Kolbe, Christoph Walther
openaire +1 more source
Theorem proving and software engineering
Software Engineering Journal, 1988No description ...
openaire +2 more sources
A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
Proceedings of the AAAI Conference on Artificial Intelligence, 2021Ibrahim Abdelaziz
exaly