ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
Latest Publications
TOTAL DOCUMENTS
41
(FIVE YEARS 0)
H-INDEX
16
(FIVE YEARS 0)
Published By IEEE Comput. Soc
0818679255
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
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
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 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
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
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
Believe it or not, AJM's games model is a model of classical linear logic
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
◽
10.1109/lics.1997.614933
◽
2002
◽
Cited By ~ 14
Author(s):
P. Baillot
◽
V. Danos
◽
T. Ehrhard
◽
L. Regnier
Keyword(s):
Linear Logic
Download Full-text
A Kleene theorem for timed automata
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
◽
10.1109/lics.1997.614944
◽
2002
◽
Cited By ~ 24
Author(s):
E. Asarin
◽
P. Caspi
◽
O. Maler
Keyword(s):
Timed Automata
◽
Kleene Theorem
Download Full-text
Full abstraction for functional languages with control
Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
◽
10.1109/lics.1997.614931
◽
2002
◽
Cited By ~ 36
Author(s):
J. Laird
Keyword(s):
Functional Languages
◽
Full Abstraction
Download Full-text
Load More ...
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close