Direct access for conjunctive queries with negations
From MaRDI portal
Cites work
- A linear time algorithm for finding tree-decompositions of small treewidth
- A negative conjunctive query is easy if and only if it is beta-acyclic
- Algorithms for propositional model counting
- Computing thejth solution of a first-order query
- Conjunctive queries with free access patterns under updates
- Constraint solving via fractional edge covers
- Direct access for conjunctive queries with negations
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 7646025 (Why is no real title available?)
- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
- Integer multiplication in time \(O(n\log n)\)
- Model counting for CNF formulas of bounded modular treewidth
- Model counting for formulas of bounded clique-width
- On compiling CNFs into structured deterministic DNNFs
- Satisfiability of acyclic and almost acyclic CNF formulas
- Size bounds for factorised representations of query results
- Solving MaxSAT and \#SAT on structured CNF formulas
- Threshold Treewidth and Hypertree Width
- Tractability beyond -acyclicity for conjunctive queries with negation and SAT
- Tractable counting of the answers to conjunctive queries
- Understanding model counting for -acyclic CNF-formulas
- Understanding the complexity of \#SAT using knowledge compilation
This page was built for publication: Direct access for conjunctive queries with negations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840487)
