Ranked enumeration for MSO on trees via knowledge compilation
From MaRDI portal
Cites work
- A glimpse on constant delay enumeration (invited talk)
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Answering UCQs under updates and in the presence of integrity constraints
- Automata, Languages and Programming
- Constant delay enumeration for FO queries over databases with local bounded expansion
- Constant-delay enumeration for nondeterministic document spanners
- Elements of finite model theory.
- Enumeration for FO Queries over Nowhere Dense Graphs
- Enumeration of monadic second-order queries on trees
- First-order queries on structures of bounded degree are computable with constant delay
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- MSO queries on trees: enumerating answers under updates
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- Optimal purely functional priority queues
- Provenance circuits for trees and treelike instances
- Size bounds for factorised representations of query results
- Weight annotation in information extraction
This page was built for publication: Ranked enumeration for MSO on trees via knowledge compilation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902062)
