Online Public Access Catalogue

Finite Model Theory and Its Applications (Record no. 14687)

MARC details
020 ## -
-- 9783540688044
-- 978-3-540-68804-4
024 7# -
-- 10.1007/3-540-68804-8
-- doi
050 #4 -
-- QA8.9-QA10.3
072 #7 -
-- UYA
-- bicssc
072 #7 -
-- MAT018000
-- bisacsh
072 #7 -
-- COM051010
-- bisacsh
082 04 -
-- 005.131
-- 23
100 1# -
-- Grädel, Erich.
-- author.
245 10 -
-- Finite Model Theory and Its Applications
-- [electronic resource] /
-- by Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y. Vardi, Yde Venema, Scott Weinstein.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2007.
300 ## -
-- XIII, 437 p. 35 illus.
-- online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# -
-- Texts in Theoretical Computer Science an EATCS Series,
-- 1862-4499
505 0# -
-- Unifying 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 ## -
-- This 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 -
-- Computer science.
650 #0 -
-- Software engineering.
650 #0 -
-- Logic design.
650 #0 -
-- Database management.
650 #0 -
-- Logic, Symbolic and mathematical.
650 14 -
-- Computer Science.
650 24 -
-- Mathematical Logic and Formal Languages.
650 24 -
-- Software Engineering.
650 24 -
-- Computation by Abstract Devices.
650 24 -
-- Logics and Meanings of Programs.
650 24 -
-- Database Management.
650 24 -
-- Mathematical Logic and Foundations.
700 1# -
-- Kolaitis, Phokion G.
-- author.
700 1# -
-- Libkin, Leonid.
-- author.
700 1# -
-- Marx, Maarten.
-- author.
700 1# -
-- Spencer, Joel.
-- author.
700 1# -
-- Vardi, Moshe Y.
-- author.
700 1# -
-- Venema, Yde.
-- author.
700 1# -
-- Weinstein, Scott.
-- author.
710 2# -
-- SpringerLink (Online service)
773 0# -
-- Springer eBooks
776 08 -
-- Printed edition:
-- 9783540004288
830 #0 -
-- Texts in Theoretical Computer Science an EATCS Series,
-- 1862-4499
856 40 -
-- http://dx.doi.org/10.1007/3-540-68804-8
912 ## -
-- ZDB-2-SCS
950 ## -
-- Computer Science (Springer-11645)
999 ## -
-- 14687
-- 14687

No items available.