Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Proof complexity of propositional model counting - MaRDI portal

Proof complexity of propositional model counting

From MaRDI portal

Publication:6643074

Jump to:navigation, search

DOI10.4230/LIPICS.SAT.2023.2MaRDI QIDQ6643074

Luc Nicolas Spachmann, Tim Hoffmann, Olaf Beyersdorff

Publication date: 26 November 2024

zbMATH Keywords

lower bounds proof systems proof complexity model counting \#SAT

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)

IASCAR: incremental answer set counting by anytime refinement

This page was built for publication: Proof complexity of propositional model counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643074)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6643074&oldid=40219794"