BibTeX record conf/lpnmr/FaberL07

download as .bib file

@inproceedings{DBLP:conf/lpnmr/FaberL07,
  author    = {Wolfgang Faber and
               Nicola Leone},
  title     = {On the Complexity of Answer Set Programming with Aggregates},
  booktitle = {Logic Programming and Nonmonotonic Reasoning, 9th International Conference,
               {LPNMR} 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings},
  pages     = {97--109},
  year      = {2007},
  crossref  = {DBLP:conf/lpnmr/2007},
  url       = {https://doi.org/10.1007/978-3-540-72200-7\_10},
  doi       = {10.1007/978-3-540-72200-7\_10},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lpnmr/FaberL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lpnmr/2007,
  editor    = {Chitta Baral and
               Gerhard Brewka and
               John S. Schlipf},
  title     = {Logic Programming and Nonmonotonic Reasoning, 9th International Conference,
               {LPNMR} 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4483},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-72200-7},
  doi       = {10.1007/978-3-540-72200-7},
  isbn      = {978-3-540-72199-4},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/lpnmr/2007},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics