On OBDDs for CNFs of Bounded Treewidth

被引：0
|
作者：
Razgon, Igor [1 ]
机构：
[1] Birkbeck Univ London, Dept Comp Sci & Informat Syst, London, England
来源：
FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING | 2014年
关键词：
COMPLEXITY;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper we show that a CNF cannot be compiled into an Ordered Binary Decision Diagram (OBDD) of fixed-parameter size parameterized by the primal graph tree width of the CNF. Thus we provide a parameterized separation between OBDDs and Sentential Decision Diagrams for which such fixed-parameter compilation is possible. We also show that the best existing parameterized upper bound for OBDDs in fact holds for incidence graph tree width parameterization.
引用
收藏
页码：92 / 100
页数：9
相关论文
共 50 条
  • [21] Trimming weighted graphs of bounded treewidth
    Knipe, David
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (06) : 902 - 912
  • [22] Waypoint routing on bounded treewidth graphs
    Schierreich, Simon
    Suchy, Ondrej
    INFORMATION PROCESSING LETTERS, 2022, 173
  • [23] Replica Placement on Bounded Treewidth Graphs
    Aggarwal, Anshul
    Chakaravarthy, Venkatesan T.
    Gupta, Neelima
    Sabharwal, Yogish
    Sharma, Sachin
    Thakral, Sonika
    ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 13 - 24
  • [24] Combinatorial optimization on graphs of bounded treewidth
    Bodlaender, Hans L.
    Koster, Arie M. C. A.
    COMPUTER JOURNAL, 2008, 51 (03): : 255 - 269
  • [25] Strong Backdoors to Bounded Treewidth SAT
    Gaspers, Serge
    Szeider, Stefan
    2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 489 - 498
  • [26] Exploiting Bounded Treewidth with Datalog (A Survey)
    Pichler, Reinhard
    DATALOG RELOADED: FIRST INTERNATIONALWORKSHOP, DATALOG 2010, 2011, 6702 : 88 - 105
  • [27] Coresets for Clustering in Graphs of Bounded Treewidth
    Baker, Daniel
    Braverman, Vladimir
    Huang, Lingxiao
    Jiang, Shaofeng H-C
    Krauthgamer, Robert
    Wu, Xuan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [28] Dynamic algorithms for graphs of bounded treewidth
    Hagerup, T
    ALGORITHMICA, 2000, 27 (3-4) : 292 - 315
  • [29] Channel assignment on graphs of bounded treewidth
    McDiarmid, C
    Reed, B
    DISCRETE MATHEMATICS, 2003, 273 (1-3) : 183 - 192
  • [30] Degree sequence optimization in bounded treewidth
    Shmuel Onn
    Optimization Letters, 2023, 17 : 1127 - 1132
12345