scientific article; zbMATH DE number 2080462
From MaRDI portal
Publication:4473259
zbMATH Open1047.68047MaRDI QIDQ4473259FDOQ4473259
Authors: Jörg Flum, Markus Frick, Martin Grohe 
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1973/19730022.htm
Title of this publication is not available (Why is that?)
Recommendations
Cited In (21)
- Algorithmic uses of the Feferman-Vaught theorem
- Conjunctive query evaluation by search-tree revisited
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Tree pattern query minimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted hypertree decompositions and optimal query plans
- Computing thejth solution of a first-order query
- Obtaining a planar graph by vertex deletion
- Structural tractability of enumerating CSP solutions
- Static analysis and query answering for incomplete data trees with constraints
- Evaluating Datalog via tree automata and cycluits
- Query evaluation via tree-decompositions
- The semijoin algebra and the guarded fragment
- Interpreting Tree-to-Tree Queries
- The monadic second-order logic evaluation problem on finite colored trees: a database-theoretic approach
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Provenance circuits for trees and treelike instances
- Combined tractability of query evaluation via tree automata and cycluits
- Logic, languages, and rules for web data extraction and reasoning over data
- Computer Science Logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473259)
