Model-checking positive equality free logic on a fixed structure (direttissima)
M Bodirsky, M Kozik, F Madelaine, B Martin… - arXiv preprint arXiv …, 2024 - arxiv.org
We give a new, direct proof of the tetrachotomy classification for the model-checking
problem of positive equality-free logic parameterised by the model. The four complexity …
problem of positive equality-free logic parameterised by the model. The four complexity …
Promises in Satisfaction Problems
K Asimi - 2023 - dspace.cuni.cz
Short Abstract This thesis focuses on the complexity of the promise version of Constraint
Satisfaction Problem (CSP) and its variants. The first study concerns the Promise Constraint …
Satisfaction Problem (CSP) and its variants. The first study concerns the Promise Constraint …