A faster algorithm for propositional model counting parameterized by incidence treewidth

DOI10.1007/978-3-030-51825-7_19OpenAlexW3040665423MaRDI QIDQ2661353

Friedrich Slivovsky, Stefan Szeider

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items (1)

An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF

This page was built for publication: A faster algorithm for propositional model counting parameterized by incidence treewidth