183 search results - page 34 / 37 » Automated theorem proving by resolution in non-classical log... |
91
Voted
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
LICS
2002
IEEE
15 years 2 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
87
Voted
CSL
2005
Springer
15 years 3 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
ICFEM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
108
Voted
MKM
2004
Springer
15 years 2 months ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...