Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818663103

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Systems of set constraints with negative constraints are NEXPTIME-complete

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316077 ◽

2002 ◽

Cited By ~ 9

Author(s):

K. Stefansson

Keyword(s):

Set Constraints

Download Full-text

A compositional proof system for the modal μ-calculus

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316076 ◽

2002 ◽

Cited By ~ 19

Author(s):

H.R. Andersen ◽

C. Stirling ◽

G. Winskel

Keyword(s):

Proof System

Download Full-text

A semantics of object types

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316056 ◽

2002 ◽

Cited By ~ 11

Author(s):

M. Abadi ◽

L. Cardelli

Download Full-text

The expressive power of finitely many generalized quantifiers

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316090 ◽

2002 ◽

Cited By ~ 7

Author(s):

A. Dawar ◽

L. Hella

Keyword(s):

Expressive Power ◽

Generalized Quantifiers

Download Full-text

On the parallel complexity of model checking in the modal mu-calculus

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316075 ◽

2002 ◽

Cited By ~ 4

Author(s):

Shipei Zhang ◽

O. Sokolsky ◽

S.A. Smolka

Keyword(s):

Model Checking ◽

Parallel Complexity

Download Full-text

A syntactic characterization of NP-completeness

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316065 ◽

2002 ◽

Cited By ~ 1

Author(s):

J.A. Medina ◽

N. Immerman

Keyword(s):

Np Completeness

Download Full-text

Bisimulation is not finitely (first order) equationally axiomatisable

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316086 ◽

2002 ◽

Cited By ~ 5

Author(s):

P. Sewell

Keyword(s):

First Order

Download Full-text

Proof search in first-order linear logic and other cut-free sequent calculi

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316061 ◽

2002 ◽

Cited By ~ 13

Author(s):

P.D. Lincoln ◽

N. Shankar

Keyword(s):

Linear Logic ◽

Sequent Calculi ◽

Order Linear ◽

First Order ◽

Proof Search

Download Full-text

Normalised rewriting and normalised completion

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316050 ◽

2002 ◽

Cited By ~ 10

Author(s):

C. Marche

Download Full-text

The power of reflective relational machines

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1994.316067 ◽

2002 ◽

Cited By ~ 6

Author(s):

S. Abiteboul ◽

C.H. Papadimitrou ◽

V. Vianu

Download Full-text

Proceedings Ninth Annual IEEE Symposium on Logic in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

Systems of set constraints with negative constraints are NEXPTIME-complete

A compositional proof system for the modal μ-calculus

A semantics of object types

The expressive power of finitely many generalized quantifiers

On the parallel complexity of model checking in the modal mu-calculus

A syntactic characterization of NP-completeness

Bisimulation is not finitely (first order) equationally axiomatisable

Proof search in first-order linear logic and other cut-free sequent calculi

Normalised rewriting and normalised completion

The power of reflective relational machines

Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
Latest Publications