1410 search results - page 192 / 282 » Proving theorems by reuse |
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
INFORMS
2010
13 years 7 months ago
2010
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
AAI
2010
13 years 5 months ago
2010
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...