The complexity of reasoning for fragments of default logic. Beyersdorff, O., Meier, A., Thomas, M., & Vollmer, H. J. Log. Comput., 22(3):587–604, 2012.
![The complexity of reasoning for fragments of default logic [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex
Paper doi bibtex Downloads: 0
{"_id":"N8JPvEQeBjAnNmovA","bibbaseid":"beyersdorff-meier-thomas-vollmer-thecomplexityofreasoningforfragmentsofdefaultlogic-2012","author_short":["Beyersdorff, O.","Meier, A.","Thomas, M.","Vollmer, H."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Olaf"],"propositions":[],"lastnames":["Beyersdorff"],"suffixes":[]},{"firstnames":["Arne"],"propositions":[],"lastnames":["Meier"],"suffixes":[]},{"firstnames":["Michael"],"propositions":[],"lastnames":["Thomas"],"suffixes":[]},{"firstnames":["Heribert"],"propositions":[],"lastnames":["Vollmer"],"suffixes":[]}],"title":"The complexity of reasoning for fragments of default logic","journal":"J. Log. Comput.","volume":"22","number":"3","pages":"587–604","year":"2012","url":"https://doi.org/10.1093/logcom/exq061","doi":"10.1093/logcom/exq061","timestamp":"Sun, 02 Oct 2022 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/logcom/BeyersdorffMTV12.bib","bibsource":"dblp computer science bibliography, https://dblp.org","author_short":["Beyersdorff, O.","Meier, A.","Thomas, M.","Vollmer, H."],"key":"DBLP:journals/logcom/BeyersdorffMTV12","id":"DBLP:journals/logcom/BeyersdorffMTV12","bibbaseid":"beyersdorff-meier-thomas-vollmer-thecomplexityofreasoningforfragmentsofdefaultlogic-2012","role":"author","urls":{"Paper":"https://doi.org/10.1093/logcom/exq061"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://dblp.org/pid/38/5700.bib","dataSources":["fBP2XTBFzsNLQjSxB"],"keywords":[],"search_terms":["complexity","reasoning","fragments","default","logic","beyersdorff","meier","thomas","vollmer"],"title":"The complexity of reasoning for fragments of default logic","year":2012}