265 search results - page 6 / 53 » How to Prove Inductive Theorems |
145
Voted
SPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
147
Voted
IJCAI
2003
15 years 4 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
131
click to vote
AAAI
2000
15 years 4 months ago
2000
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
130
Voted
FM
1999
Springer
15 years 7 months ago
1999
Springer
Support for system speci cation in terms of modelling and simulation environments has become a common practice in safety-critical applications. Also, a current trend is the automat...
158
Voted
TPHOL
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...