Inproceedings3357: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Piotr Ostropolski-Nalewaja (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Piotr |ErsterAutorNachname=Ostropolski-Nalewaja |FurtherAuthors=Bartosz Bednarczyk }} {{Inproceedings |Referiert…“) |
Piotr Ostropolski-Nalewaja (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname= | |ErsterAutorVorname=Grzegorz | ||
|ErsterAutorNachname= | |ErsterAutorNachname=Głuch | ||
|FurtherAuthors= | |FurtherAuthors=Jerzy Marcinkowski; Piotr Ostropolski-Nalewaja | ||
}} | }} | ||
{{Inproceedings | {{Inproceedings |
Aktuelle Version vom 13. Juni 2023, 15:32 Uhr
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
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
- Forschungsgruppe:Research Group: Computational LogicComputational Logic
@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}
}