Tree-Width for First Order Formulae (Q3644741)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Tree-Width for First Order Formulae	scientific article

Statements

scholarly article

0 references

Tree-Width for First Order Formulae (English)

0 references

0 references

0 references

Computer Science Logic

0 references

publication date

12 November 2009

0 references

full work available at URL

https://arxiv.org/abs/1203.3814

0 references

MaRDI profile type

MaRDI publication profile

0 references

Marshals, monotone marshals, and hypertree-width

0 references

Directed tree-width examples

0 references

Tree-Related Widths of Graphs and Hypergraphs

0 references

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

0 references

Conjunctive query containment revisited

0 references

Computer Science Logic

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

Query evaluation via tree-decompositions

0 references

Hypertree decompositions and tractable queries

0 references

Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.

0 references

Constraint solving via fractional edge covers

0 references

Conjunctive-query containment and constraint satisfaction

0 references

Digraph Decompositions and Monotonicity in Digraph Searching

0 references

Graph searching and a min-max theorem for tree-width

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-04027-6_8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3644741

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3644741&oldid=35137142"