1410 search results - page 146 / 282 » Proving theorems by reuse |
143
click to vote
CONTEXT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
137
click to vote
SIAMDM
2008
15 years 6 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
161
click to vote
MICCAI
2003
Springer
16 years 7 months ago
2003
Springer
Detecting glaucoma progression is crucial for assessing the effectivity of the treatment. This paper describes three methods for detecting progression related changes in polarimetr...
137
click to vote
CORR
2011
Springer
15 years 13 days ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
205
Voted
CSFW
1999
IEEE
15 years 10 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...