Tree-width for first order formulae

Details Tree-width for first order formulae Tree-width for first order formulae

2012-03-16

arxiv.org/abs/1203.3814v2

Computer Science

Logic in Computer Science

Scientific paper

We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed parameter tractable, with parameter the length of the formula. This is done by translating a formula \phi\ with fotw(\phi)

Affiliated with

Also associated with

No associations

Rating

Tree-width for first order formulae 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 Tree-width for first order formulae, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-width for first order formulae will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-312717