233 search results - page 6 / 47 » Applications of Polytypism in Theorem Proving |
CADE
2004
Springer
15 years 9 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
JAIR
2011
14 years 4 months ago
2011
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
IJCAI
2003
14 years 10 months ago
2003
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...
CADE
2008
Springer
15 years 9 months ago
2008
Springer
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...