Hypertree Decompositions and Tractable Queries

Hypertree Decompositions and Tractable Queries

Show other versions (3)

Detalles Bibliográficos
Main Authors:	Gottlob, G, Leone, N, Scarcello, F
Formato:	Journal article
Publicado:	2002

Títulos similares

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1998)

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1999)

Hypertree Decompositions and Tractable Queries
por: Gottlob, G, et al.
Publicado: (1999)

Hypertree Decompositions: A Survey
por: Gottlob, G, et al.
Publicado: (2001)

Hypertree decompositions: questions and answers
por: Gottlob, G, et al.
Publicado: (2016)

On Tractable Queries and Constraints
por: Gottlob, G, et al.
Publicado: (1999)

Generalized hypertree decompositions: np−hardness and tractable variants
por: Gottlob, G, et al.
Publicado: (2007)

Generalized hypertree decompositions: np-hardness and tractable variants.
por: Gottlob, G, et al.
Publicado: (2007)

Hypertree Decompositions: Structure‚ Algorithms‚ and Applications
por: Gottlob, G, et al.
Publicado: (2005)

Robbers‚ marshals‚ and guards: game theoretic and logical characterizations of hypertree width
por: Gottlob, G, et al.
Publicado: (2003)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado: (2001)

Robbers‚ Marshals‚ and Guards: Game Theoretic and Logical Characterizations of Hypertree Width
por: Gottlob, G, et al.
Publicado: (2001)

Combining hypertree‚ bicomp‚ and hinge decomposition
por: Gottlob, G, et al.
Publicado: (2002)

Incremental updates of generalized hypertree decompositions
por: Gottlob, G, et al.
Publicado: (2022)

A Backtracking−Based Algorithm for Computing Hypertree−Decompositions
por: Gottlob, G, et al.
Publicado: (2007)

Complexity analysis of generalized and fractional hypertree decompositions
por: Gottlob, G, et al.
Publicado: (2021)

General and fractional hypertree decompositions: hard and easy cases
por: Fischl, W, et al.
Publicado: (2018)

General and fractional hypertree decompositions: hard and easy cases
por: Fischl, W, et al.
Publicado: (2018)

On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
por: Gottlob, G, et al.
Publicado: (2007)

Fast parallel hypertree decompositions in logarithmic recursion depth
por: Gottlob, G, et al.
Publicado: (2022)

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

Tractable Query Answering over Conceptual Schemata
por: Calì, A, et al.
Publicado: (2009)

The complexity of acyclic conjunctive queries
por: Gottlob, G, et al.
Publicado: (2001)

The Complexity of Acyclic Conjunctive Queries
por: Gottlob, G, et al.
Publicado: (1998)

Tractable Query Answering over Conceptual Schemata (Extended Abstract)
por: Calì, A, et al.
Publicado: (2010)

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
por: Gottlob, G, et al.
Publicado: (2017)

Enhancing datalog reasoning with hypertree decompositions
por: Zhang, X, et al.
Publicado: (2023)

Hypertree width and related hypergraph invariants
por: Adler, I, et al.
Publicado: (2007)

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

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

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

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

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

A Comparison of Structural CSP Decomposition Methods
por: Gottlob, G, et al.
Publicado: (1999)

A comparison of structural CSP decomposition methods
por: Gottlob, G, et al.
Publicado: (2000)

Hypertree-Width and Related Hypergraph Invariants
por: Isolde Adler, et al.
Publicado: (2005-01-01)

A General Datalog−Based Framework for Tractable Query Answering over Ontologies (Extended Abstract)
por: Calì, A, et al.
Publicado: (2009)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
por: Gottlob, G, et al.
Publicado: (2001)

Hypergraphs in Model Checking: Acyclicity and Hypertree−Width versus Clique−Width
por: Gottlob, G, et al.
Publicado: (2004)

Tractable query answering for description logics via query rewriting
por: Perez-Urbina, H, et al.
Publicado: (2010)