Results 1  10
of
29,331
The Philosophy of Automated Theorem Proving
 In Proceedings of the 12. International Joint Conference on Artificial Intelligence (IJCAI91
, 1991
"... Different researchers use "the philosophy of automated theorem proving " to cover different concepts, indeed, different levels of concepts. Some would count such issues as how to efficiently index databases as part of the philosophy of automated theorem proving. Others wonder about whether ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
Different researchers use "the philosophy of automated theorem proving " to cover different concepts, indeed, different levels of concepts. Some would count such issues as how to efficiently index databases as part of the philosophy of automated theorem proving. Others wonder about
Automated theorem proving in algebra
, 2009
"... David Stanovsk´y (Prague) ATP in algebra 1 / 18Automated theorem proving INPUT: A finite set of first order formulas OUTPUT: Satisfiable / Unsatisfiable / I don’t know (Timeout) What is it good for: proving theorems in mathematics David Stanovsk´y (Prague) ATP in algebra 2 / 18Automated theorem prov ..."
Abstract
 Add to MetaCart
David Stanovsk´y (Prague) ATP in algebra 1 / 18Automated theorem proving INPUT: A finite set of first order formulas OUTPUT: Satisfiable / Unsatisfiable / I don’t know (Timeout) What is it good for: proving theorems in mathematics David Stanovsk´y (Prague) ATP in algebra 2 / 18Automated theorem
Automating Theorem Proving with SMT
, 2013
"... The power and automation offered by modern satisfiabilitymodulotheories (SMT) solvers is changing the landscape for mechanized formal theorem proving. For instance, the SMTbased program verifier Dafny supports a number of proof features traditionally found only in interactive proof assistants, ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The power and automation offered by modern satisfiabilitymodulotheories (SMT) solvers is changing the landscape for mechanized formal theorem proving. For instance, the SMTbased program verifier Dafny supports a number of proof features traditionally found only in interactive proof assistants
Automated Theorem Proving in Software Engineering
"... Introduction. The quickly rising amount and complexity of developed and used software require more and more a rigorous application of formal methods during the entire software life cycle. Points of particular interest include: specification and its refinements, program synthesis, software reuse, sup ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
, support for testing and debugging, software reengineering, and software/hardware codesign (e.g., [16]). Wherever formal methods are applied, proof tasks of most different size and complexity arise in large quantities. Traditionally, interactive theorem provers (e.g., PVS, KIV, HOL, Isabelle) are being
Automated theorem proving in loop theory
 proceedings of the ESARM workshop
, 2008
"... In this paper we compare the performance of various automated theorem provers on nearly all of the theorems in loop theory known to have been obtained with the assistance of automated theorem provers. Our analysis yields some surprising results, e.g., the theorem prover most often used by loop theor ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
In this paper we compare the performance of various automated theorem provers on nearly all of the theorems in loop theory known to have been obtained with the assistance of automated theorem provers. Our analysis yields some surprising results, e.g., the theorem prover most often used by loop
HigherOrder Automated Theorem Proving
, 1998
"... Consistency Class) Let Ñ S be a class of sets of propositions, then Ñ S is called an abstract consistency class, iff each Ñ S is closed under subsets, and satisfies conditions (1) to (8) for all sets F 2 Ñ S . If it also satisfies (9), then we call it extensional. 1. If A is atomic, then A = 2 F or ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Consistency Class) Let Ñ S be a class of sets of propositions, then Ñ S is called an abstract consistency class, iff each Ñ S is closed under subsets, and satisfies conditions (1) to (8) for all sets F 2 Ñ S . If it also satisfies (9), then we call it extensional. 1. If A is atomic, then A = 2 F or :A = 2 F. 2. If A 2 F and if B is the bhnormal form of A, then B F 2 Ñ S 2 . 3. If ::A 2 F, then A F 2 Ñ S . 4. If AB2F, then F A 2 Ñ S or F B 2 Ñ S . 5. If :(AB) 2 F, then F :A :B2 Ñ S . 6. If P a A 2 F, then F AB 2 Ñ S for each closed formula B 2 wff a (S). 7. If :P a A 2 F, then F :(Aw a ) 2 Ñ S for any witness constant w a 2 W that does not occur in F. 8. If :(A = a!b B) 2 F, then F :(Aw a = Bw) 2 Ñ S for any witness constant w a 2 W that does not occur in F. 9. If :(A = o B) 2 F, then F[fA;:Bg 2 Ñ S or F[f:A;Bg 2 Ñ S . Here, we treat equality as an abbreviation for Leibniz definition. We call an abstract consistency class saturated, iff for all F 2 Ñ S and all...
The Use of Analogy in Automated Theorem Proving
, 1989
"... this paper is to review the requirements for analogical reasoning in proof discovery and discuss some approaches. This paper is not intended as an objective survey of past approaches to this problem. Instead, it is a condensation of the important insights of others together with some of my own. Howe ..."
Abstract
 Add to MetaCart
this paper is to review the requirements for analogical reasoning in proof discovery and discuss some approaches. This paper is not intended as an objective survey of past approaches to this problem. Instead, it is a condensation of the important insights of others together with some of my own. However, in an area of research which is still in its early stages, there is no clear agreement of the "important insights," so the reader must accept my subjective bias. Furthermore, when I state the key ideas of some author's work, it should not be assumed that that author shares my assessment of what his contribution is. 2 Overview
1 The CADE20 Automated Theorem Proving Competition
"... The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems. CASC20 was the tenth competition in the CASC series. Seventeen ATP systems and system variants competed in the various competition and demonstration divisions. An outlin ..."
Abstract
 Add to MetaCart
The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic, first order Automated Theorem Proving systems. CASC20 was the tenth competition in the CASC series. Seventeen ATP systems and system variants competed in the various competition and demonstration divisions
Results 1  10
of
29,331