Timed Definite Clause Omega-Grammars

Authors Neda Saeedloei, Gopal Gupta

Thumbnail PDF


  • Filesize: 313 kB
  • 10 pages

Document Identifiers

Author Details

Neda Saeedloei
Gopal Gupta

Cite AsGet BibTex

Neda Saeedloei and Gopal Gupta. Timed Definite Clause Omega-Grammars. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 212-221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


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


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail