Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

DOI10.1007/978-3-642-21581-0_6zbMath1331.68115OpenAlexW2963126840MaRDI QIDQ3007673

Daniël Paulusma, Stefan Szeider, Sebastian Ordyniak

Publication date: 17 June 2011

Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Related Items (1)

Boundary properties of the satisfiability problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finding solutions for extended Horn formulas
• A partial k-arboretum of graphs with bounded treewidth
• Upper bounds to the clique width of graphs
• Algorithms for propositional model counting
• Counting truth assignments of formulas of bounded tree-width or clique-width
• Satisfiability of Acyclic and Almost Acyclic CNF Formulas.
• Degrees of acyclicity for hypergraphs and relational database schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Graph Classes: A Survey
• A Computing Procedure for Quantification Theory

This page was built for publication: Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)