ACM Home Page
Please provide us with feedback. Feedback
Introduction
Full text PdfPdf (121 KB)
Source
ACM SIGACT News archive
Volume 38 ,  Issue 3  (September 2007) table of contents
COLUMN: Logic table of contents
Pages: 76 - 76  
Year of Publication: 2007
ISSN:0163-5700
Author
Riccardo Pucella  Northeastern University, Boston, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 17,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1324215.1324230
What is a DOI?

ABSTRACT

In this issue, Lomuscio and Penczek survey some of the recent work in verification of temporal-epistemic logic via symbolic model checking, focussing on OBDD-based and SAT-based approaches for epistemic logics built on discrete and real-time branching time temporal logics.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. P. van Ditmarsch, W. van der Hoek, R. van der Meyden, and J. Ruan. Model checking Russian Cards. Electronic Notes in Theoretical Computer Science, 149(2):105--123, 2006.
 
2
H. P. van Ditmarsch. The Russian Cards problem. Studia Logica, 75:31--62, 2003.