Narrow your search

Library

UGent (3)

KU Leuven (1)

UAntwerpen (1)

UHasselt (1)

ULiège (1)


Resource type

book (3)


Language

English (3)


Year
From To Submit

2008 (1)

2007 (2)

Listing 1 - 3 of 3
Sort by
Finite model theory and its applications
Authors: --- ---
ISBN: 9783540004288 Year: 2007 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Computational complexity. --- Constraint databases. --- Finite model theory. --- Computer science --- Computational complexity --- Constraint databases --- Finite model theory --- 681.3*F13 --- 681.3*F41 --- 681.3*H23 --- 681.3*I24 --- 681.3*I28 --- 681.3*I24 Knowledge representation formalisms and methods: frames and scripts; predicate logic; relation systems; representation languages; procedural and rule-based representations; semantic networks (Artificial intelligence) --- Knowledge representation formalisms and methods: frames and scripts; predicate logic; relation systems; representation languages; procedural and rule-based representations; semantic networks (Artificial intelligence) --- 681.3*H23 Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- Languages: data description languages; DDL; data manupulation languages; DML;query languages; report writers (Database management) --- Model theory --- Databases --- Complexity, Computational --- Electronic data processing --- Machine theory --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 681.3*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematics --- Informatique


Book
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Authors: ---
ISBN: 1595936858 Year: 2007 Publisher: ACM

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Authors: ---
ISBN: 1605581526 Year: 2008 Publisher: ACM

Loading...
Export citation

Choose an application

Bookmark

Abstract

Listing 1 - 3 of 3
Sort by