Structure-guided automated reasoning
From MaRDI portal
Cites work
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- Algorithmic meta-theorems
- Algorithms and complexity results for \#SAT and Bayesian inference
- Algorithms for propositional model counting
- Bounded-width QBF is PSPACE-complete
- Declarative dynamic programming as an alternative realization of Courcelle's theorem
- Decomposable negation normal form
- Graph minors. II. Algorithmic aspects of tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- Lower Bounds for QBFs of Bounded Treewidth
- Monadic Datalog over finite structures of bounded treewidth
- On non-serial dynamic programming
- On the parallel parameterized complexity of MaxSAT variants
- Parametrized complexity theory.
- QBF as an alternative to Courcelle's theorem
- S-functions for graphs
- Satisfiability, branch-width and Tseitin tautologies
- Solving #SAT and MAXSAT by Dynamic Programming
- Solving projected model counting by utilizing treewidth and its limits
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Tractable QBF by knowledge compilation
- Weak Second‐Order Arithmetic and Finite Automata
This page was built for publication: Structure-guided automated reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287746)
