咨询与建议

限定检索结果

文献类型

  • 4 篇 会议
  • 1 篇 期刊文献

馆藏范围

  • 5 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5 篇 工学
    • 4 篇 计算机科学与技术...
    • 3 篇 软件工程
  • 2 篇 理学
    • 2 篇 数学

主题

  • 5 篇 propositional mo...
  • 2 篇 rank-width
  • 2 篇 knowledge compil...
  • 2 篇 clique-width
  • 2 篇 parameterized co...
  • 2 篇 satisfiability
  • 1 篇 propositional pr...
  • 1 篇 #sat
  • 1 篇 maxsat
  • 1 篇 parameterized al...
  • 1 篇 dynamic programm...
  • 1 篇 preprocessing
  • 1 篇 bounded treewidt...

机构

  • 2 篇 masaryk univ fac...
  • 1 篇 univ potsdam pot...
  • 1 篇 tu wien austria
  • 1 篇 univ artois lens
  • 1 篇 tech univ dresde...
  • 1 篇 univ lille inria...
  • 1 篇 cril cnrs lens

作者

  • 2 篇 ganian robert
  • 2 篇 hlineny petr
  • 2 篇 obdrzalek jan
  • 1 篇 marquis pierre
  • 1 篇 zisser markus
  • 1 篇 hecher markus
  • 1 篇 fichte johannes ...
  • 1 篇 lagniez jean-mar...
  • 1 篇 capelli florent

语言

  • 5 篇 英文
检索条件"主题词=Propositional Model Counting"
5 条 记 录,以下是1-10 订阅
排序:
On Preprocessing Techniques and Their Impact on propositional model counting
收藏 引用
JOURNAL OF AUTOMATED REASONING 2017年 第4期58卷 413-481页
作者: Lagniez, Jean-Marie Marquis, Pierre CRIL CNRS Lens France Univ Artois Lens France
This paper is concerned with preprocessing techniques for propositional model counting. We have considered several elementary preprocessing techniques: backbone identification, occurrence reduction, vivification, as w... 详细信息
来源: 评论
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Better Algorithms for Satisfiability Problems for Formulas o...
收藏 引用
35th International Symposium on Mathematical Foundations of Computer Science
作者: Ganian, Robert Hlineny, Petr Obdrzalek, Jan Masaryk Univ Fac Informat Brno Czech Republic
We provide a parameterized algorithm for the propositional model counting problem #SAT, the runtime of which has a single-exponential dependency on the rank-width of the signed graph of a formula. That is, our algorit... 详细信息
来源: 评论
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Better Algorithms for Satisfiability Problems for Formulas o...
收藏 引用
30th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
作者: Ganian, Robert Hlineny, Petr Obdrzalek, Jan Masaryk Univ Fac Informat Brno Czech Republic
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been ... 详细信息
来源: 评论
Knowledge Compilation Languages as Proof Systems  1
收藏 引用
22nd International Conference on Theory and Applications of Satisfiability Testing (SAT)
作者: Capelli, Florent Univ Lille INRIA UMR 9189 CRIStAL Ctr Rech Informat Signal & Automat Lille F-59000 Lille France
In this paper, we study proof systems in the sense of Cook-Reckhow for problems that are higher in the Polynomial Hierarchy than coNP, in particular, #SAT and maxSAT. We start by explaining how the notion of Cook-Reck... 详细信息
来源: 评论
An Improved GPU-Based SAT model Counter  25th
An Improved GPU-Based SAT Model Counter
收藏 引用
25th International Conference on the Principles and Practice of Constraint Programming (CP)
作者: Fichte, Johannes K. Hecher, Markus Zisser, Markus Tech Univ Dresden Dresden Germany TU Wien Vienna Austria Univ Potsdam Potsdam Germany
In this paper, we present and evaluate a new parallel propositional model counter, called gpusat2, which is based on dynamic programming (DP) on tree decompositions using log-counters. gpusat2 extends its predecessor ... 详细信息
来源: 评论