文章基本信息

标题：Timed Definite Clause Omega-Grammars
本地全文：下载
作者：Neda Saeedloei ; Gopal Gupta
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2010
卷号：7
页码：212-221
DOI：10.4230/LIPIcs.ICLP.2010.212
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：We propose timed context-free grammars (TCFGs) and show how parsers for such grammars can be developed using definite clause grammars (DCGs) coupled with constraints over reals (CLP(R)). Timed context-free grammars describe timed context-free languages (TCFLs). We next extend timed context-free grammars to timed context-free omega-grammars (omega-TCFGs for brevity) and incorporate co-inductive logic programming in DCGs to obtain parsers for them. Timed context-free omega-grammars describe timed context-free languages containing infinite-sized words, and are a generalization of timed omega-regular languages recognized by timed automata. We show a practical application of omega-TCFGs to the well-known generalized railroad crossing problem.
关键词：Constraint Logic Programming over reals; Co-induction; Context-Free Grammars; Omega-Grammars