Results 251 to 260 of about 523,591 (296)
Some of the next articles are maybe not open access.
Proving Theorems With the Modification Method
SIAM Journal on Computing, 1975A 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).
exaly +2 more sources
The Specialization of Programs by Theorem Proving
SIAM Journal on Computing, 1973Suppose a program P is written to accept a set of inputs I. If we are only interested in a nonempty subset $I^ * $ of I, we usually can simplify P to another program $P^ * $ such that $P^ * $ runs faster on $I^ * $ than P does. The problem of specialization is to find such $P^ * $. In this paper, the program P and the input $I^ * $ will be specified by
Chin-Liang Chang +2 more
openaire +3 more sources
On Theorem Proving in Annotated Logics
Journal of Applied Non-Classical Logics, 2000ABSTRACT We are concerned with the theorem proving in annotated logics. By using annotated polynomials to express knowledge, we develop an inference rule superposition. A proof procedure is thus presented, and an improvement named M- strategy is mainly described.
Lu, M., Wu, J.
openaire +2 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
A Theorem-Proving Language for Experimentation
Communications of the ACM, 1974Because of the large number of strategies and inference rules presently under consideration in automated theorem proving, there is a need for developing a language especially oriented toward automated theorem proving. This paper discusses some of the features and instructions of this language.
Lawrence J. Henschen +2 more
openaire +3 more sources
WIREs Cognitive Science, 2014
Automated theorem proving is the use of computers to prove or disprove mathematical or logical statements. Such statements can express properties of hardware or software systems, or facts about the world that are relevant for applications such as natural language processing and planning.
openaire +2 more sources
Automated theorem proving is the use of computers to prove or disprove mathematical or logical statements. Such statements can express properties of hardware or software systems, or facts about the world that are relevant for applications such as natural language processing and planning.
openaire +2 more sources
Analogy in Inductive Theorem Proving
Journal of Automated Reasoning, 1999In this paper the authors describe analogy-driven proof plan construction in inductive theorem proving. The analogies investigated are external analogies. An analogy procedure is obtained that is incorporated into the generic proof planner CLAM. Several examples to illustrate this procedure are presented.
Erica Melis, Jon Whittle 0001
openaire +1 more source
Theorem proving with abstraction
Artificial Intelligence, 1981Translation from Artif. Intell. 16, 47-108 (English) (1981; Zbl 0454.68113).
openaire +2 more sources
Refinement and Theorem Proving
2006In 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 +2 more sources
The Concept of Demodulation in Theorem Proving
Journal of the ACM, 1967In 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 +3 more
openaire +2 more sources