Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

@book{citeulike:1746802, abstract = {{<P>This book gives a comprehensive overview of central themes of finite model theory \&\#8211; expressive power, descriptive complexity, and zero-one laws \&\#8211; together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of and hierarchies within first-order, second-order, fixed-point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics.</P> <P>The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraiss\'{e} pebble game, as a powerful way to analyze the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and treewidth, arise naturally in the application of finite model theory to database theory and AI.</P> <P>Students of logic and computer science will find here the tools necessary to embark on research into finite model theory, and all readers will experience the excitement of a vibrant area of the application of logic to computer science.</P>}}, author = {Gr\"{a}del, Erich and Kolaitis, Phokion G. and Libkin, Leonid and Marx, Maarten and Spencer, Joel and Vardi, Moshe Y. and Venema, Yde and Weinstein, Scott }, citeulike-article-id = {1746802}, howpublished = {Hardcover}, isbn = {3540004289}, keywords = {complexity, logic, math}, month = {June}, posted-at = {2008-04-22 06:10:52}, priority = {2}, publisher = {Springer}, title = {Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)}, url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20\&amp;path=ASIN/3540004289}, year = {2007} }

TY - BOOK ID - citeulike:1746802 L3 - citeulike-article-id:1746802 TI - Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series) PB - Springer SN - 3540004289 N2 - {<P>This book gives a comprehensive overview of central themes of finite model theory &#8211; expressive power, descriptive complexity, and zero-one laws &#8211; together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of and hierarchies within first-order, second-order, fixed-point, and infinitary logics to gain insight into phenomena in complexity theory and combinatorics.</P> <P>The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraissé pebble game, as a powerful way to analyze the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and treewidth, arise naturally in the application of finite model theory to database theory and AI.</P> <P>Students of logic and computer science will find here the tools necessary to embark on research into finite model theory, and all readers will experience the excitement of a vibrant area of the application of logic to computer science.</P>} KW - complexity KW - logic KW - math AU - Grädel, Erich AU - Kolaitis, Phokion AU - Libkin, Leonid AU - Marx, Maarten AU - Spencer, Joel AU - Vardi, Moshe AU - Venema, Yde AU - Weinstein, Scott PY - 2007/06/11/ UR - http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&amp;path=ASIN/3540004289 ER -