000			04048nam a22006855i 4500
001			978-3-540-68804-4
003			DE-He213
005			20160614135735.0
007			cr nn 008mamaa
008			100301s2007 gw | s |||| 0|eng d
020			_a9783540688044 _9978-3-540-68804-4
024	7		_a10.1007/3-540-68804-8 _2doi
049			_aAlfaisal Main Library
050		4	_aQA75.5-76.95
072		7	_aUY _2bicssc
072		7	_aUYA _2bicssc
072		7	_aCOM014000 _2bisacsh
072		7	_aCOM031000 _2bisacsh
082	0	4	_a004.0151 _223
100	1		_aGrädel, Erich. _eauthor.
245	1	0	_aFinite Model Theory and Its Applications _h[electronic resource] / _cby Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007.
300			_aXI, 437 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTexts in Theoretical Computer Science an EATCS Series, _x1862-4499
505	0		_aUnifying Themes in Finite Model Theory -- On the Expressive Power of Logics on Finite Models -- Finite Model Theory and Descriptive Complexity -- Logic and Random Structures -- Embedded Finite Models and Constraint Databases -- A Logical Approach to Constraint Satisfaction -- Local Variations on a Loose Theme: Modal Logic and Decidability.
520			_aThis book gives a broad overview of core topics of finite model theory: expressive power, descriptive complexity, and zero-one laws, together with selected applications to database theory and artificial intelligence, especially, constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, which emphasizes 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. The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraissé pebble game, as a powerful technique for analyzing the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and tree-width, arise naturally in the application of finite model theory to database theory and AI. Students of logic and computer science will find here the tools necessary to embark on research in finite model theory, and all readers will experience the excitement of a vibrant area of application of logic to computer science.
650		0	_aComputer science.
650		0	_aSoftware engineering.
650		0	_aComputers.
650		0	_aComputer logic.
650		0	_aMathematical logic.
650		0	_aDatabase management.
650	1	4	_aComputer Science.
650	2	4	_aTheory of Computation.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aSoftware Engineering.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aDatabase Management.
655		7	_aElectronic books. _2local
700	1		_aKolaitis, Phokion G. _eauthor.
700	1		_aLibkin, Leonid. _eauthor.
700	1		_aMarx, Maarten. _eauthor.
700	1		_aSpencer, Joel. _eauthor.
700	1		_aVardi, Moshe Y. _eauthor.
700	1		_aVenema, Yde. _eauthor.
700	1		_aWeinstein, Scott. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540004288
830		0	_aTexts in Theoretical Computer Science an EATCS Series, _x1862-4499
856	4	0	_uhttp://ezproxy.alfaisal.edu/login?url=http://dx.doi.org/10.1007/3-540-68804-8
912			_aZDB-2-SCS
942			_2lcc _cEBOOKS
999			_c251507 _d251507