Provenance Circuits for Trees and Treelike Instances
From MaRDI portal
Publication:3449465
DOI10.1007/978-3-662-47666-6_5zbMath1440.68053arXiv1511.08723OpenAlexW2733688566MaRDI QIDQ3449465
Pierre Bourhis, Antoine Amarilli, Pierre Senellart
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08723
Related Items
Unnamed Item ⋮ Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees ⋮ An Experimental Study of the Treewidth of Real-World Graph Data ⋮ Evaluating Datalog via tree automata and cycluits ⋮ Connecting knowledge compilation classes and width parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rules with existential variables: walking the decidability line
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Probabilistic Inference and Monadic Second Order Logic
- Monadic datalog over finite structures of bounded treewidth
- Probabilistic Databases
- Easy problems for tree-decomposable graphs
- Query evaluation via tree-decompositions
- Graph minors. II. Algorithmic aspects of tree-width
- Transducers with Origin Information
- Generalized finite automata theory with an application to a decision problem of second-order logic
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Back and forth between guarded and modal logics
This page was built for publication: Provenance Circuits for Trees and Treelike Instances