Hypertree Decompositions and Tractable Queries

Hypertree Decompositions and Tractable Queries

Show other versions (3)

Bibliographic Details
Main Authors:	Gottlob, G, Leone, N, Scarcello, F
Format:	Conference item
Published:	1999

Similar Items

Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1999)

Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1998)

Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (2002)

Hypertree Decompositions: A Survey
by: Gottlob, G, et al.
Published: (2001)

Hypertree decompositions: questions and answers
by: Gottlob, G, et al.
Published: (2016)

On Tractable Queries and Constraints
by: Gottlob, G, et al.
Published: (1999)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

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

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

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

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

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

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