HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder.

Marie Fortin Louwe B. Kuijer Patrick Totzke Martin Zimmermann

Published in: CoRR (2023)

Keyphrases

np complete
satisfiability problem
np hard
computational complexity
sufficient conditions
sat problem
phase transition
propositional logic
randomly generated
information systems
search algorithm
query processing
data model
constraint programming
conjunctive queries