Monadic datalog over finite structures with bounded treewidth

Monadic datalog over finite structures with bounded treewidth

Bibliographic Details
Main Authors:	Gottlob, G, Pichler, R, Wei, F
Format:	Conference item
Published:	ACM 2007

Similar Items

Monadic datalog over finite structures of bounded treewidth.
by: Gottlob, G, et al.
Published: (2010)

Efficient Datalog Abduction through Bounded Treewidth
by: Gottlob, G, et al.
Published: (2007)

Tractable database design through bounded treewidth
by: Gottlob, G, et al.
Published: (2006)

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
by: Gottlob, G, et al.
Published: (2006)

Bounded treewidth as a key to tractability of knowledge representation and reasoning
by: Gottlob, G, et al.
Published: (2010)

Monadic Datalog Containment
by: Benedikt, M, et al.
Published: (2012)

Monadic Datalog Containment
by: Benedikt, M, et al.
Published: (2012)

Monadic datalog, tree validity, and limited access containment
by: Benedikt, M, et al.
Published: (2019)

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
by: Gottlob, G, et al.
Published: (2002)

Monadic datalog and the expressive power of languages for Web information extraction
by: Gottlob, G, et al.
Published: (2004)

Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
by: Gottlob, G, et al.
Published: (2002)

Size and treewidth bounds for conjunctive queries.
by: Gottlob, G, et al.
Published: (2009)

On the treewidths of graphs of bounded degree.
by: Yinglei Song, et al.
Published: (2015-01-01)

Monadic Queries over Tree−Structured Data
by: Gottlob, G, et al.
Published: (2002)

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
by: Cristina Feier, et al.
Published: (2019-05-01)

Dynamic Programming on Graphs with Bounded Treewidth
by: Bodlaender, Hans L.
Published: (2023)

Channel assignment on graphs of bounded treewidth.
by: McDiarmid, C, et al.
Published: (2003)

Separating layered treewidth and row treewidth
by: Prosenjit Bose, et al.
Published: (2022-05-01)

An efficient partitioning oracle for bounded-treewidth graphs
by: Hassidim, Avinatan, et al.
Published: (2012)

Tractable Query Answering over Ontologies with Datalog+⁄−
by: Calì, A, et al.
Published: (2009)

The parameterised complexity of list problems on graphs of bounded treewidth
by: Scott, A, et al.
Published: (2016)

Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
by: McDiarmid, C, et al.
Published: (2001)

Counting Euler Tours in Undirected Bounded Treewidth Graphs
by: Balaji, N, et al.
Published: (2015)

Disjunctive Datalog
by: Eiter, T, et al.
Published: (1997)

Datalog+⁄−: Questions and Answers
by: Gottlob, G, et al.
Published: (2014)

Adding Disjunction to Datalog
by: Eiter, T, et al.
Published: (1994)

Linear Datalog and Bounded Path Duality of Relational Structures
by: Victor Dalmau
Published: (2005-04-01)

Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)
by: Demaine, Erik D., et al.
Published: (2023)

The stackelberg minimum spanning tree game on planar and bounded-treewidth graphs
by: Cardinal, Jean, et al.
Published: (2011)

Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
by: Demaine, Erik D., et al.
Published: (2023)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies
by: Calì, A, et al.
Published: (2012)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies
by: Calì, A, et al.
Published: (2009)

A general datalog-based framework for tractable query answering over ontologies.
by: Calì, A, et al.
Published: (2009)

A general Datalog-based framework for tractable query answering over ontologies.
by: Calì, A, et al.
Published: (2012)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies
by: Calì, A, et al.
Published: (2012)

On the Complexity of Single−Rule Datalog Queries
by: Gottlob, G, et al.
Published: (1999)

On the complexity of single−rule datalog queries
by: Gottlob, G, et al.
Published: (2003)

An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
by: Zongwen Bai, et al.
Published: (2019-11-01)

Answering Threshold Queries in Probabilistic Datalog+/- Ontologies.
by: Gottlob, G, et al.
Published: (2011)

Conjunctive Query Answering in Probabilistic Datalog+⁄− Ontologies
by: Gottlob, G, et al.
Published: (2011)