License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2010.212
URN: urn:nbn:de:0030-drops-25994
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2599/
Go to the corresponding LIPIcs Volume Portal


Saeedloei, Neda ; Gupta, Gopal

Timed Definite Clause Omega-Grammars

pdf-format:
10003.SaeedloeiNeda.2599.pdf (0.3 MB)


Abstract

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.

BibTeX - Entry

@InProceedings{saeedloei_et_al:LIPIcs:2010:2599,
  author =	{Neda Saeedloei and Gopal Gupta},
  title =	{{Timed Definite Clause Omega-Grammars}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{212--221},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Manuel Hermenegildo and Torsten Schaub},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2599},
  URN =		{urn:nbn:de:0030-drops-25994},
  doi =		{10.4230/LIPIcs.ICLP.2010.212},
  annote =	{Keywords: Constraint Logic Programming over reals, Co-induction, Context-Free Grammars, Omega-Grammars}
}

Keywords: Constraint Logic Programming over reals, Co-induction, Context-Free Grammars, Omega-Grammars
Collection: Technical Communications of the 26th International Conference on Logic Programming
Issue Date: 2010
Date of publication: 25.06.2010


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI