888 search results - page 28 / 178 » The Power of Temporal Proofs |
AIMSA
1998
Springer
15 years 2 months ago
1998
Springer
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
AAAI
2010
14 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
DIAGRAMS
2010
Springer
14 years 10 months ago
2010
Springer
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
CAV
2001
Springer
15 years 2 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
104
click to vote
ITP
2010
14 years 11 months ago
2010
Recent advances in termination analysis have yielded new methods and tools that are highly automatic. However, when they fail, even experts have difficulty understanding why and de...