Hypertree Decompositions and Tractable Queries

Hypertree Decompositions and Tractable Queries

Show other versions (3)

Bibliografske podrobnosti
Main Authors:	Gottlob, G, Leone, N, Scarcello, F
Format:	Conference item
Izdano:	1999

Podobne knjige/članki

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1999)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (1998)

Hypertree Decompositions and Tractable Queries
od: Gottlob, G, et al.
Izdano: (2002)

Hypertree Decompositions: A Survey
od: Gottlob, G, et al.
Izdano: (2001)

Hypertree decompositions: questions and answers
od: Gottlob, G, et al.
Izdano: (2016)

On Tractable Queries and Constraints
od: Gottlob, G, et al.
Izdano: (1999)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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