Treewidth-Aware Complexity in ASP: Not All Positive Cycles Are Equally Hard (bibtex)
by ,
Reference:
Treewidth-Aware Complexity in ASP: Not All Positive Cycles Are Equally HardMarkus Hecher, Jorge FandinnoProceedings of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 6312–6320, 2021.
Bibtex Entry:
@inproceedings{HecherF21,
  author  = "Markus Hecher and Jorge  Fandinno",
  title     = {Treewidth-Aware  Complexity  in  ASP:  Not  All  Positive  Cycles  Are  Equally  Hard},
  booktitle = {Proceedings of AAAI-21, the Thirty-Fifth AAAI
                  Conference on Artificial Intelligence},
  year      = {2021},
   pages     = {6312--6320},
  keywords  = {reveal}
}
Powered by bibtexbrowser