Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Tree-width for first order formulae Isolde Adler1
 

Summary: Tree-width for first order formulae
Isolde Adler1
and Mark Weyer2
1
Department of Informatics, University of Bergen, Norway
2
Humboldt Universit¨at zu Berlin, Berlin, Germany
Abstract We introduce tree-width for first order formulae , fotw().
We show that computing fotw is fixed-parameter tractable with parame-
ter 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 with fotw() < k
into a formula of the k-variable fragment Lk
of first order logic. For fixed
k, the question whether a given first order formula is equivalent to an
Lk
formula is undecidable. In contrast, the classes of first order formu-
lae with bounded fotw are fragments of first order logic for which the
equivalence is decidable.
Our notion of tree-width generalises tree-width of conjunctive queries to

  

Source: Adler, Isolde - Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main

 

Collections: Computer Technologies and Information Sciences