Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769501583

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Counting and addition cannot express deterministic transitive closure

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782627 ◽

2003 ◽

Cited By ~ 3

Author(s):

M. Ruhl

Keyword(s):

Transitive Closure

Download Full-text

Entailment of atomic set constraints is PSPACE-complete

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782623 ◽

2003 ◽

Author(s):

J. Niehren ◽

M. Muller ◽

J.-M. Talbot

Keyword(s):

Set Constraints

Download Full-text

Logics with counting, auxiliary relations, and lower bounds for invariant queries

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782626 ◽

2003 ◽

Cited By ~ 2

Author(s):

L. Libkin

Keyword(s):

Lower Bounds

Download Full-text

Weak bisimulation and open maps

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782590 ◽

2003 ◽

Cited By ~ 7

Author(s):

M. Fiore ◽

G.L. Cattani ◽

G. Winskel

Keyword(s):

Weak Bisimulation ◽

Open Maps

Download Full-text

Extensional equality in intensional type theory

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782636 ◽

2003 ◽

Cited By ~ 9

Author(s):

T. Altenkirch

Keyword(s):

Type Theory

Download Full-text

Type inference for recursive definitions

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782600 ◽

2003 ◽

Cited By ~ 1

Author(s):

A.J. Kfoury ◽

S.M. Pericas-Geertsen

Keyword(s):

Type Inference ◽

Recursive Definitions

Download Full-text

A new approach to abstract syntax involving binders

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782617 ◽

2003 ◽

Cited By ~ 56

Author(s):

M. Gabbay ◽

A. Pitts

Keyword(s):

Abstract Syntax ◽

New Approach

Download Full-text

Parametric quantitative temporal reasoning

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782628 ◽

2003 ◽

Cited By ~ 21

Author(s):

E.A. Emerson ◽

R.J. Trefler

Keyword(s):

Temporal Reasoning

Download Full-text

Some decision problems of enormous complexity

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782577 ◽

2003 ◽

Cited By ~ 2

Author(s):

H.M. Friedman

Keyword(s):

Decision Problems

Download Full-text

A superposition decision procedure for the guarded fragment with equality

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) ◽

10.1109/lics.1999.782624 ◽

2003 ◽

Cited By ~ 23

Author(s):

H. Ganzinger ◽

H. de Nivelle

Keyword(s):

Decision Procedure ◽

Guarded Fragment

Download Full-text

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

Counting and addition cannot express deterministic transitive closure

Entailment of atomic set constraints is PSPACE-complete

Logics with counting, auxiliary relations, and lower bounds for invariant queries

Weak bisimulation and open maps

Extensional equality in intensional type theory

Type inference for recursive definitions

A new approach to abstract syntax involving binders

Parametric quantitative temporal reasoning

Some decision problems of enormous complexity

A superposition decision procedure for the guarded fragment with equality

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
Latest Publications