BibTeX record: conf/sat/BeyersdorffMTV09

download as .bib file

@inproceedings{DBLP:conf/sat/BeyersdorffMTV09,
  author    = {Olaf Beyersdorff and
               Arne Meier and
               Michael Thomas and
               Heribert Vollmer},
  title     = {The Complexity of Reasoning for Fragments of Default Logic},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
               International Conference, {SAT} 2009, Swansea, UK, June 30 - July
               3, 2009. Proceedings},
  year      = {2009},
  pages     = {51--64},
  crossref  = {DBLP:conf/sat/2009},
  url       = {http://dx.doi.org/10.1007/978-3-642-02777-2_7},
  doi       = {10.1007/978-3-642-02777-2_7},
  timestamp = {Thu, 02 Oct 2014 01:16:41 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sat/BeyersdorffMTV09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sat/2009,
  editor    = {Oliver Kullmann},
  title     = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
               International Conference, {SAT} 2009, Swansea, UK, June 30 - July
               3, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  year      = {2009},
  volume    = {5584},
  publisher = {Springer},
  url       = {http://dx.doi.org/10.1007/978-3-642-02777-2},
  doi       = {10.1007/978-3-642-02777-2},
  isbn      = {978-3-642-02776-5},
  timestamp = {Thu, 02 Oct 2014 01:16:41 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/sat/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}