Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirtieth Annual IEEE Symposium on

Logic in Computer Science (LICS 2015)

Paper: The Complexity of Boundedness for Guarded Logics (at LICS 2015)

Authors: Michael Benedikt Balder ten Cate Thomas Colcombet Michael Vanden Boom

Abstract

No Abstract Available

BibTeX

  @InProceedings{BenediktCateColcomb-TheComplexityofBoun,
    author = 	 {Michael Benedikt and Balder ten Cate and Thomas Colcombet and Michael Vanden Boom},
    title = 	 {The Complexity of Boundedness for Guarded Logics},
    booktitle =  {Proceedings of the Thirtieth Annual IEEE Symposium on Logic in Computer Science (LICS 2015)},
    year =	 {2015},
    month =	 {July}, 
    pages =      {293--304},
    location =   {Kyoto, Japan}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2018-06-2121:59
Andrzej Murawski