421 search results - page 23 / 85 » CSL |
CSL
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...
80
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
We define strong monads of continuous (lower, upper) previsions, and of forks, modeling both probabilistic and non-deterministic choice. This is an elegant alternative to recent p...
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present a method of integrating linear rational arithmetic into superposition calculus for first-order logic. One of our main results is completeness of the resulting...
CSL
2007
Springer
15 years 6 months ago
2007
Springer
We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof ...
CSL
2005
Springer
15 years 5 months ago
2005
Springer
We study the complexity of model-checking for the fixpoint extension of Hintikka and Sandu’s independence-friendly logic. We show that this logic captures ExpTime; and by embedd...