Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting (bibtex)
by Thomas Eiter, Markus Hecher, Rafael Kiesel
Reference:
Treewidth-Aware Cycle Breaking for Algebraic Answer Set CountingThomas Eiter, Markus Hecher, Rafael KieselProceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021 (Meghyn Bienvenu, Gerhard Lakemeyer, Esra Erdem, eds.), pages 269–279, 2021.
Bibtex Entry:
@inproceedings{DBLP:conf/kr/EiterHK21,
  author    = {Thomas Eiter and
               Markus Hecher and
               Rafael Kiesel},
  editor    = {Meghyn Bienvenu and
               Gerhard Lakemeyer and
               Esra Erdem},
  title     = {Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting},
  booktitle = {Proceedings of the 18th International Conference on Principles of
               Knowledge Representation and Reasoning, {KR} 2021, Online event, November
               3-12, 2021},
  pages     = {269--279},
  year      = {2021},
  url       = {https://doi.org/10.24963/kr.2021/26},
  doi       = {10.24963/kr.2021/26},
  timestamp = {Wed, 03 Nov 2021 12:47:32 +0100},
  biburl    = {https://dblp.org/rec/conf/kr/EiterHK21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Powered by bibtexbrowser