Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable

From International Center for Computational Logic

Toggle side column

Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable

Grzegorz GłuchGrzegorz Głuch,  Jerzy MarcinkowskiJerzy Marcinkowski,  Piotr Ostropolski-NalewajaPiotr Ostropolski-Nalewaja
Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 492–501, 2018. Association for Computing Machinery
@inproceedings{GMO2018,
  author    = {Grzegorz G{\l}uch and Jerzy Marcinkowski and Piotr
               Ostropolski-Nalewaja},
  title     = {Can One Escape Red Chains? Regular Path Queries Determinacy is
               Undecidable},
  booktitle = {Proceedings of the 33rd Annual {ACM/IEEE} Symposium on Logic in
               Computer Science},
  publisher = {Association for Computing Machinery},
  year      = {2018},
  pages     = {492{\textendash}501},
  doi       = {10.1145/3209108.3209120}
}