Search
 
Home| Contact Us| Join Our Mailing List| New Journals| Browse Journals| Journal Prices| For Authors| Advanced Search
HOME > JOURNALS BY SUBJECT > COMPUTER SCIENCE > IJFCS
International Journal of Foundations of Computer Science (IJFCS)
Current Issue | 2010 | 2009 | 2008 | All Volumes (1990-2010)
Volume: 20, Issue: 4(2009) pp. 747-762     DOI: 10.1142/S0129054109006851
Abstract | Full Text (PDF, 240KB) | References
Title: AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
The work is partly supported by NSC grant 96-3114-P-001-002-Y. The second author is also supported by NSC grant 95-2221-E-001-024-MY3, 97-2221-E-001-006-MY3 and the SISARL thematic project of Academia Sinica.
Author(s):
YIH-KUEN TSAY
Department of Information Management, National Taiwan University, Number 1, Section 4, Roosevelt Road, Taipei, 106, Taiwan
BOW-YAW WANG
Institute of Information Science, Academia Sinica, Number 128, Section 2, Academia Road, Taipei, 115, Taiwan
History:
Received 19 May 2009
Accepted 25 June 2009
Abstract:
Analysis of infinitary safety properties with automated compositional reasoning through learning is discussed in the paper. We consider the class of intuitionistically closed regular languages and show that it forms a Heyting algebra and is finitely approximatable. Subsequently, compositional proof rules can be verified automatically and learning algorithms for finitary regular languages suffice. We also establish an axiom to deduce circular compositional proof rules for the infinitary languages.
Keywords:
Intuitionistic logic; automata theory
Imperial College Press  |  Global Publishing  |  Asia-Pacific Biotech News  |  Innovation Magazine
Labcreations Co  |  Meeting Matters  |  National Academies Press

World Scientific is a Member of CrossRef

Copyright © 2010 World Scientific Publishing Co. All rights reserved.