Proceedings of Twelfth 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

0818679255

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A partially deadlock-free typed process calculus

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614941 ◽

2002 ◽

Cited By ~ 16

Author(s):

N. Kobayashi

Keyword(s):

Process Calculus

Download Full-text

The "Hardest" natural decidable theory

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614956 ◽

2002 ◽

Cited By ~ 3

Author(s):

S. Vorobyov

Keyword(s):

Decidable Theory

Download Full-text

Complexity of power default reasoning

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614959 ◽

2002 ◽

Cited By ~ 1

Author(s):

Guo-Qiang Zhang ◽

W.C. Rounds

Keyword(s):

Default Reasoning

Download Full-text

Linear higher-order pre-unification

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614967 ◽

2002 ◽

Cited By ~ 6

Author(s):

I. Cervesato ◽

F. Pfenning

Keyword(s):

Higher Order

Download Full-text

The monadic quantifier alternation hierarchy over graphs is infinite

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614951 ◽

2002 ◽

Cited By ~ 11

Author(s):

O. Matz ◽

W. Thomas

Keyword(s):

Quantifier Alternation

Download Full-text

On the forms of locality over finite models

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614948 ◽

2002 ◽

Cited By ~ 18

Author(s):

L. Libkin

Keyword(s):

Finite Models

Download Full-text

Combination of compatible reduction orderings that are total on ground terms

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614917 ◽

2002 ◽

Cited By ~ 1

Author(s):

F. Baader

Download Full-text

Set constraints with intersection

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614962 ◽

2002 ◽

Cited By ~ 11

Author(s):

W. Charatonik ◽

A. Podelski

Keyword(s):

Set Constraints

Download Full-text

Large finite structures with few L/sup κ/-types

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614949 ◽

2002 ◽

Cited By ~ 3

Author(s):

M. Grohe

Keyword(s):

Finite Structures

Download Full-text

Unique fixpoint induction for value-passing processes

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science ◽

10.1109/lics.1997.614942 ◽

2002 ◽

Cited By ~ 3

Author(s):

J. Rathke

Download Full-text

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

A partially deadlock-free typed process calculus

The "Hardest" natural decidable theory

Complexity of power default reasoning

Linear higher-order pre-unification

The monadic quantifier alternation hierarchy over graphs is infinite

On the forms of locality over finite models

Combination of compatible reduction orderings that are total on ground terms

Set constraints with intersection

Large finite structures with few L/sup κ/-types

Unique fixpoint induction for value-passing processes

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
Latest Publications