<--- Back to Details
First PageDocument Content
Finite model theory / Computational complexity theory / Model theory / FO / Structure / Datalog / Transitive closure / Database theory / Descriptive complexity theory / Mathematics / Theoretical computer science / Mathematical logic
Date: 2009-06-14 11:31:33
Finite model theory
Computational complexity theory
Model theory
FO
Structure
Datalog
Transitive closure
Database theory
Descriptive complexity theory
Mathematics
Theoretical computer science
Mathematical logic

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Download Document from Source Website

File Size: 257,11 KB

Share Document on Facebook

Similar Documents

Datafun: A Functional Datalog Michael Arntzenius Neelakantan R. Krishnaswami University of Birmingham (UK)

DocID: 1uWtO - View Document

CALL FOR PAPERS DATALOG 2.0 THE 2nd INTERNATIONAL WORKSHOP ON THE RESURGENCE OF DATALOG IN ACADEMIA AND INDUSTRY September 11-13, 2012, Vienna, Austria http://www.dbai.tuwien.ac.at/datalog2.0

DocID: 1uCru - View Document

Combined Tractability of Query Evaluation via Tree Automata and Cycluits Antoine Amarilli, Pierre Bourhis, Mikaƫl Monet, Pierre Senellart Problem Evaluate Datalog queries tractably in parameterized combined complexity

DocID: 1unuC - View Document

Exercise 1 Datalog and Network Reliability Program Analysis for System Security and Reliability 2018 ETH Zurich February 27, 2018

DocID: 1ugls - View Document

1 Toward Parallel CFA with Datalog, MPI, and CUDA THOMAS GILRAY, University of Maryland SIDHARTH KUMAR, University of Utah We present our recent experience working to design parallel functional control-flow analysis (CF

DocID: 1u2XE - View Document