421 search results - page 49 / 85 » CSL |
75
Voted
CSL
1995
Springer
15 years 1 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
91
Voted
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
102
click to vote
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...