Linear Datalog and Bounded Path Duality of Relational Structures

Details Linear Datalog and Bounded Path Duality of Relational Structures Linear Datalog and Bounded Path Duality of Relational Structures

2005-04-07

arxiv.org/abs/cs/0504027v4

LMCS 1 (1:5) 2005

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-1(1:5)2005

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 embodiments of a unique robust notion that we call bounded path duality. We also study the computational complexity implications of the notion of bounded path duality. We show that every constraint satisfaction problem $\csp(\best)$ with bounded path duality is solvable in NL and that this notion explains in a uniform way all families of CSPs known to be in NL. Finally, we use the results developed in the paper to identify new problems in NL.

Affiliated with

Also associated with

No associations

Rating

Linear Datalog and Bounded Path Duality of Relational Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Datalog and Bounded Path Duality of Relational Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Datalog and Bounded Path Duality of Relational Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362324