Affiliation:
1. Warsaw University, Warsaw, Poland
Abstract
We prove that satisfiability problem for word equations is in PSPACE.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
85 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Slice closures of indexed languages and word equations with counting constraints;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. A Survey on String Constraint Solving;ACM Computing Surveys;2023-01-31
3. A Solver for Arrays with Concatenation;Journal of Automated Reasoning;2023-01-07
4. First Steps Towards Taming Description Logics with Strings;Logics in Artificial Intelligence;2023
5. Data Path Queries over Embedded Graph Databases;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12