2026-08-14T12:09:33Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6554 2024-03-06T10:38:42Z ddc:004 open_access

Dependence Logic vs. Constraint Satisfaction Hella, Lauri Kolaitis, Phokion G. Dependence logic constraint satisfaction computational complexity expressive power During the past decade, dependence logic has emerged as a formalism suitable for expressing and analyzing notions of dependence and independence that arise in different scientific areas. The sentences of dependence logic have the same expressive power as those of existential second-order logic, hence dependence logic captures NP on the class of all finite structures. In this paper, we identify a natural fragment of universal dependence logic and show that, in a precise sense, it captures constraint satisfaction. This tight connection between dependence logic and constraint satisfaction contributes to the descriptive complexity of constraint satisfaction and elucidates the expressive power of universal dependence logic. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lauri Hella and Phokion G. Kolaitis 2016 Is Part Of LIPIcs, Volume 62, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2016.14 urn:nbn:de:0030-drops-65548 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.14 eng https://creativecommons.org/licenses/by/3.0/legalcode