Results 1  10
of
1,319
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
The yices smt solver
, 2006
"... Abstract. SMT stands for Satisfiability Modulo Theories. An SMT solver decides the satisfiability of propositionally complex formulas in theories such as arithmetic and uninterpreted functions with equality. SMT solving has numerous applications in automated theorem proving, in hardware and software ..."
Abstract

Cited by 97 (1 self)
 Add to MetaCart
Abstract. SMT stands for Satisfiability Modulo Theories. An SMT solver decides the satisfiability of propositionally complex formulas in theories such as arithmetic and uninterpreted functions with equality. SMT solving has numerous applications in automated theorem proving, in hardware
Theorem Proving with the Real Numbers
, 1996
"... This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification ..."
Abstract

Cited by 119 (13 self)
 Add to MetaCart
This thesis discusses the use of the real numbers in theorem proving. Typically, theorem provers only support a few `discrete' datatypes such as the natural numbers. However the availability of the real numbers opens up many interesting and important application areas, such as the verification
Theorem Proving Modulo
 Journal of Automated Reasoning
"... Abstract. Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of much wider interest because it permits to separate computations and deductions in a clean way. The first ..."
Abstract

Cited by 111 (18 self)
 Add to MetaCart
Abstract. Deduction modulo is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of much wider interest because it permits to separate computations and deductions in a clean way. The first
An Evaluation of Automated Theorem Proving in Regular Algebra
"... Introduction The Isabelle/HOL environment [8] combines the power of automated reasoning with higherorder features for theory engineering and proof management. Its builtin Sledgehammer tool integrates state of the art ATP and SMT tools, allowing for powerful automated reasoning in proofs [2]. The ..."
Abstract
 Add to MetaCart
Introduction The Isabelle/HOL environment [8] combines the power of automated reasoning with higherorder features for theory engineering and proof management. Its builtin Sledgehammer tool integrates state of the art ATP and SMT tools, allowing for powerful automated reasoning in proofs [2]. The
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
Automated and Interactive Theorem Proving
"... The idea of mechanizing reasoning is an old dream that can be traced at least back to Leibniz. Since about 1950, there has been considerable research on having computers perform logical reasoning, either completely autonomously (automated theorem proving) or in cooperation with a person (interactiv ..."
Abstract
 Add to MetaCart
The idea of mechanizing reasoning is an old dream that can be traced at least back to Leibniz. Since about 1950, there has been considerable research on having computers perform logical reasoning, either completely autonomously (automated theorem proving) or in cooperation with a person (in
Automating Induction with an SMT Solver
, 2011
"... Mechanical proof assistants have always had support for inductive proofs. Sometimes an alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation. However, SMT solvers do not natively support induction, so inductive proofs require s ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
Mechanical proof assistants have always had support for inductive proofs. Sometimes an alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of a higher degree of automation. However, SMT solvers do not natively support induction, so inductive proofs require
Results 1  10
of
1,319