Results 271 to 280 of about 17,772 (305)

Refinement and Theorem Proving

2006
In this chapter, we describe the ACL2 theorem proving system and show how it can be used to model and verify hardware using refinement. This is a timely problem, as the ever-increasing complexity of microprocessor designs and the potentially devastating economic consequences of shipping defective products has made functional verification a ...
openaire   +1 more source

The Concept of Demodulation in Theorem Proving

Journal of the ACM, 1967
In many fields of mathematics the richness of the underlying axiom set leads to the establishment of a number of very general equalities. For example, it is easy to prove that in groups ( x -1 ) -1 = x and that in rings - x · -
Larry Wos, George A. Robinson, Daniel F. Carson, Leon Shalla   +3 more
openaire   +1 more source

Automated theorem proving in mathematics

Annals of Mathematics and Artificial Intelligence, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Theorem Proving for Verification

2001
The 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   +1 more source

Unsound Theorem Proving

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

Proving Theorems with the Modification Method

SIAM Journal on Computing, 1975
A method for proving theorems in first order predicate calculus theories with equality is described and proven complete. Completeness of this “Modification Method” implies completeness of Paramodulation without the functionally reflexive axioms, thus proving a conjecture of Wos and Robinson (1969).
openaire   +1 more source

Proving Theorems by Pattern Recognition - II

Bell System Technical Journal, 1960
Certain 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

Theorem proving by combinatorial optimization

1993
The 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   +1 more source

Automated theorem proving methods

BIT, 1985
A 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

How to Prove Sklar’s Theorem

2013
In this contribution we stress the importance of Sklar’s theorem and present a proof of this result that is based on the compactness of the class of copulas (proved via elementary arguments) and the use of mollifiers ...
Fabrizio Durante, Juan Fernández-Sánchez, Carlo Sempi   +2 more
openaire   +2 more sources