Computer Science Logic - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

36

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540875307, 9783540875314

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_31 ◽

2008 ◽

pp. 431-445

Author(s):

Jochen Eisinger

Keyword(s):

Upper Bounds ◽

Linear Arithmetic

Download Full-text

A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_19 ◽

2008 ◽

pp. 246-261

Author(s):

Paolo Tranquilli

Keyword(s):

Linear Logic ◽

Semantic Correctness

Download Full-text

A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_17 ◽

2008 ◽

pp. 215-229 ◽

Author(s):

Stefano Berardi ◽

Ugo de’Liguoro

Download Full-text

Continuous Fragment of the mu-Calculus

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_12 ◽

2008 ◽

pp. 139-153 ◽

Author(s):

Gaëlle Fontaine

Download Full-text

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_27 ◽

2008 ◽

pp. 369-384 ◽

Author(s):

Sven Schewe

Keyword(s):

Optimal Strategy ◽

Improvement Algorithm

Download Full-text

Extensional Uniformity for Boolean Circuits

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_7 ◽

2008 ◽

pp. 64-78

Author(s):

Pierre McKenzie ◽

Michael Thomas ◽

Heribert Vollmer

Keyword(s):

Boolean Circuits

Download Full-text

Quantified Positive Temporal Constraints

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_9 ◽

2008 ◽

pp. 94-108 ◽

Author(s):

Witold Charatonik ◽

Michał Wrona

Keyword(s):

Temporal Constraints

Download Full-text

Type-Based Termination with Sized Products

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_35 ◽

2008 ◽

pp. 493-507 ◽

Author(s):

Gilles Barthe ◽

Benjamin Grégoire ◽

Colin Riba

Download Full-text

Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_23 ◽

2008 ◽

pp. 308-322 ◽

Author(s):

Ian Hodkinson ◽

Angelo Montanari ◽

Guido Sciavicco

Keyword(s):

Temporal Logics ◽

Finite Axiomatizability ◽

Interval Temporal Logics

Download Full-text

Characterization of Logics over Ranked Tree Languages

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-87531-4_29 ◽

2008 ◽

pp. 401-415 ◽

Author(s):

Thomas Place

Keyword(s):

Download Full-text