Sciweavers

1322 search results - page 35 / 265
» Unsound Theorem Proving
Sort
View
IJCAI
2003
13 years 9 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
CJ
2006
78views more  CJ 2006»
13 years 7 months ago
A Very Mathematical Dilemma
Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undeci...
Alan Bundy
CADE
2008
Springer
14 years 7 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
AISC
1998
Springer
13 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
ENTCS
2006
131views more  ENTCS 2006»
13 years 7 months ago
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
This paper is a case study in combining theorem provers. We define a derived rule in HOL-Light, CVC PROVE, which calls CVC Lite and translates the resulting proof object back to HO...
Sean McLaughlin, Clark Barrett, Yeting Ge