Computer Science Logic - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer-Verlag

3540582770

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Logical aspects of set constraints

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049332 ◽

2006 ◽

pp. 175-188 ◽

Cited By ~ 5

Author(s):

Dexter Kozen

Keyword(s):

Set Constraints

Download Full-text

Program transformation and proof transformation

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049339 ◽

2006 ◽

pp. 305-317 ◽

Cited By ~ 2

Author(s):

Wilfried Sieg ◽

Stanley S. Wainer

Keyword(s):

Program Transformation

Download Full-text

On the reasons for average superlinear speedup in parallel backtrack search

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049327 ◽

2006 ◽

pp. 106-127

Author(s):

Andreas Goerdt ◽

Udo Kamps

Keyword(s):

Backtrack Search ◽

Superlinear Speedup

Download Full-text

Short proofs of tautologies using the schema of equivalence

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049322 ◽

2006 ◽

pp. 33-35 ◽

Cited By ~ 5

Author(s):

Matthias Baaz ◽

Richard Zach

Download Full-text

The complexity of set constraints

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049320 ◽

2006 ◽

pp. 1-17 ◽

Cited By ~ 21

Author(s):

Alexander Aiken ◽

Dexter Kozen ◽

Moshe Vardi ◽

Ed Wimmers

Keyword(s):

Set Constraints

Download Full-text

Petri nets and the equivalence problem

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049331 ◽

2006 ◽

pp. 165-174 ◽

Cited By ~ 20

Author(s):

Yoram Hirshfeld

Keyword(s):

Petri Nets ◽

Equivalence Problem

Download Full-text

A Horn clause that implies an undecidable set of Horn clauses

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049334 ◽

2006 ◽

pp. 223-237 ◽

Cited By ~ 4

Author(s):

Jerzy Marcinkowski

Keyword(s):

Horn Clause ◽

Horn Clauses

Download Full-text

Higher-order action calculi

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049335 ◽

2006 ◽

pp. 238-260 ◽

Cited By ~ 7

Author(s):

Robin Milner

Keyword(s):

Higher Order

Download Full-text

A generic strong normalization argument: Application to the Calculus of Constructions

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049336 ◽

2006 ◽

pp. 261-279 ◽

Cited By ~ 1

Author(s):

C. -H. L. Ong ◽

E. Ritter

Keyword(s):

Strong Normalization ◽

Calculus Of Constructions

Download Full-text

Bounded-arity hierarchies in fixed-point logics

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0049330 ◽

2006 ◽

pp. 150-164 ◽

Cited By ~ 2

Author(s):

Martin Grohe

Keyword(s):

Fixed Point

Download Full-text

Computer Science Logic - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer-Verlag

Logical aspects of set constraints

Program transformation and proof transformation

On the reasons for average superlinear speedup in parallel backtrack search

Short proofs of tautologies using the schema of equivalence

The complexity of set constraints

Petri nets and the equivalence problem

A Horn clause that implies an undecidable set of Horn clauses

Higher-order action calculi

A generic strong normalization argument: Application to the Calculus of Constructions

Bounded-arity hierarchies in fixed-point logics

Computer Science Logic - Lecture Notes in Computer Science
Latest Publications