Linear Datalog and Bounded Path Duality of Relational Structures

In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems, all these concepts correspond to different mathematical embod...

Popoln opis

Bibliografske podrobnosti

Glavni avtor:	Victor Dalmau
Format:	Artigo
Jezik:	Inglês
Izdano:	Logical Methods in Computer Science e.V. 2005-04-01
Serija:	Logical Methods in Computer Science
Teme:	computer science - logic in computer science computer science - computational complexity f.1.3 f.4.1
Online dostop:	https://lmcs.episciences.org/2275/pdf
Oznake:	Označite Brez oznak, prvi označite!