Unication Problems Modulo a Theory of Until

8 pages•Published: July 29, 2013

Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly Gero and Paliath Narendran

Abstract

Our main aim in this paper is to investigate an equational theory consisting of a number of identities or equivalences in Linear Temporal Logic (LTL) with the “until” operator U, but without the “next-time” operator. We investigate unification problems modulo this theory. Two variants of unification are also studied, namely asymmetric unification and disunification. Our main focus is on algorithmic complexity.

Keyphrases: asymmetric unification, disunification, equational unification, linear temporal logic, np completeness, polynomial time complexity, term rewriting

In: Konstantin Korovin and Barbara Morawska (editors). UNIF 2013. 27th International Workshop on Unification, vol 19, pages 22-29.

Links:	https://easychair.org/publications/paper/9d
	https://doi.org/10.29007/mj4l

BibTeX entry

@inproceedings{UNIF2013:Unication_Problems_Modulo_Theory,
  author    = {Shreyaben Brahmakshatriya and Sushma Danturi and Kimberly Gero and Paliath Narendran},
  title     = {Unication Problems Modulo a Theory of Until},
  booktitle = {UNIF 2013. 27th International Workshop on Unification},
  editor    = {Konstantin Korovin and Barbara Morawska},
  series    = {EPiC Series in Computing},
  volume    = {19},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/9d},
  doi       = {10.29007/mj4l},
  pages     = {22-29},
  year      = {2013}}

Download PDF Open PDF in browser