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

Piotr Ostropolski-NalewajaPiotr Ostropolski-Nalewaja, Bartosz BednarczykBartosz Bednarczyk

DOI Link

Piotr Ostropolski-Nalewaja, Bartosz Bednarczyk
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

Details
Bibtex

Forschungsgruppe:Research Group: Computational LogicComputational Logic

@inproceedings{OB2018,
  author    = {Piotr Ostropolski-Nalewaja and Bartosz Bednarczyk},
  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}
}