Last update: Fri Mar 23 02:20:06 MDT 2018
@Article{Dvorak:2012:CCJ, author = "Wolfgang Dvo{\v{r}}{\'a}k", title = "On the Complexity of Computing the Justification Status of an Argument", journal = j-LECT-NOTES-COMP-SCI, volume = "7132", pages = "32--49", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-29184-5_3", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:24:45 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012b.bib", URL = "http://link.springer.com/chapter/10.1007/978-3-642-29184-5_3/", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-29184-5", book-URL = "http://www.springerlink.com/content/978-3-642-29184-5", fjournal = "Lecture Notes in Computer Science", }