Temporal Constraint Satisfaction Problems in Fixed-Point Logic

DOI10.1145/3373718.3394750zbMath1498.08003arXiv2002.09451OpenAlexW3031230092MaRDI QIDQ5145634

Jakub Rydval, Manuel Bodirsky, Wied Pakusa

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.09451

zbMATH Keywords

fixed-point logicMaltsev conditionstemporal constraint satisfaction problems

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of universal algebra in computer science (08A70) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (3)

Solving equation systems in ω-categorical algebras ⋮ Unnamed Item ⋮ ASNP: a tame fragment of existential second-order logic

This page was built for publication: Temporal Constraint Satisfaction Problems in Fixed-Point Logic