Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings > The Data Complexity of MDatalog in Basic Modal Logics
Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings |
Rastislav Královic; Pawel Urzyczyn
Springer Berlin Heidelberg
Mathematical Foundations of Computer Science 2006: 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings
The Data Complexity of MDatalog in Basic Modal Logics
Authors

Linh Anh Nguyen

ARI Id

1664798007433_3265546

Access

Not Available Free

Pages

729-740

DOI

10.1007/11821069_63

Chapter URL

https://rd.springer.com/chapter/10.1007/11821069_63

Table of Contents of Book
Showing 1 to 20 of 71 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
A Core Calculus for Scala Type Checking
Vincent Cremet; François Garillot; Sergueï Lenglet; Martin Odersky
1-23
Tree Exploration with an Oracle
Pierre Fraigniaud; David Ilcinkas; Andrzej Pelc
24-37
Distributed Data Structures: A Survey on Informative Labeling Schemes
Cyril Gavoille
38-38
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
Herman Geuvers; Iris Loeb
39-57
The Structure of Tractable Constraint Satisfaction Problems
Martin Grohe
58-72
On the Representation of Kleene Algebras with Tests
Dexter Kozen
73-83
From Three Ideas in TCS to Three Applications in Bioinformatics
Ming Li
84-85
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
O. Aichholzer; C. Huemer; S. Kappes; B. Speckmann; C. D. Tóth
86-97
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
Lyudmil Aleksandrov; Hristo N. Djidjev; Hua Guo; Anil Maheshwari; Doron Nussbaum; Jörg-Rüdiger Sack
98-109
A Unified Construction of the Glushkov, Follow, and Antimirov Automata
Cyril Allauzen; Mehryar Mohri
110-121
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
Pablo Arrighi
122-133
A Polynomial Time Nilpotence Test for Galois Groups and Related Results
V. Arvind; Piyush P Kurur
134-145
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
Richard Beigel; William Gasarch; James Glenn
146-156
Crochemore Factorization of Sturmian and Other Infinite Words
Jean Berstel; Alessandra Savelli
157-166
Equations on Partial Words
F. Blanchet-Sadri; D. Dakota Blair; Rebeca V. Lewis
167-178
Concrete Multiplicative Complexity of Symmetric Functions
Joan Boyar; René Peralta
179-189
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
Laurent Boyer; Victor Poupet; Guillaume Theyssier
190-201
Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities
Ulrik Brandes; Jürgen Lerner
202-213
The Kleene Equality for Graphs
Arnaud Carayol; Didier Caucal
214-225
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 71 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings