{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T04:29:19Z","timestamp":1741753759649,"version":"3.38.0"},"reference-count":35,"publisher":"SAGE Publications","issue":"2","funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I1102,S11403- N23,W1255-N23"],"award-info":[{"award-number":["I1102,S11403- N23,W1255-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Argument & Computation"],"published-print":{"date-parts":[[2015,5,4]]},"DOI":"10.1080\/19462166.2015.1036922","type":"journal-article","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T14:58:32Z","timestamp":1434639512000},"page":"149-177","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":8,"title":["Reasoning in abstract dialectical frameworks using quantified Boolean formulas"],"prefix":"10.1177","volume":"6","author":[{"given":"Martin","family":"Diller","sequence":"first","affiliation":[]},{"given":"Johannes Peter","family":"Wallner","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"179","published-online":{"date-parts":[[2015,6,18]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2013.03.009"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2010.05.004"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.3.429"},{"key":"CIT0004","doi-asserted-by":"crossref","first-page":"133","DOI":"10.3233\/SAT190055","volume":"5","author":"Benedetti M.","year":"2008","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"CIT0005","unstructured":"Brewka G., Ellmauthaler S., Strass H., Wallner J.P. & Woltran S. (2013). Abstract dialectical frameworks revisited. In F. Rossi (Ed.),Proceedings of the 23rd international joint conference on artificial intelligence, IJCAI 2013(pp.\u00a0803\u2013809). Palo Alto, CA: AAAI Press \/ IJCAI."},{"key":"CIT0006","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MIS.2013.122","volume":"29","author":"Brewka G.","year":"2014","journal-title":"IEEE Intelligent Systems"},{"key":"CIT0007","unstructured":"Brewka G. & Woltran S. (2010). Abstract dialectical frameworks. In F. Lin, U. Sattler, & M. Truszczy\u0144ski (Eds.),Proceedings of the twelfth international conference on principles of knowledge representation and reasoning, KR 2010(pp.\u00a0102\u2013111). Palo Alto, CA: AAAI Press."},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Bryant R.E., Lahiri S.K. & Seshia S.A. (2003). Convergence testing in term-level bounded model checking. In D. Geist & E. Tronci (Eds.),Proceedings of the twelfth advanced research working conference on correct hardware design and verification methods, CHARME-2003, Vol. 2860 ofLecture notes in computer science(pp.\u00a0348\u2013362). Berlin: Springer.","DOI":"10.1007\/978-3-540-39724-3_31"},{"key":"CIT0009","unstructured":"B\u00fcning H.K. & Bubeck U. (2009). Theory of quantified Boolean formulas. In A. Biere, M. Heule, H. van Maaren, & T. Walsh (Eds.),Handbook of satisfiability, Vol. 185 ofFrontiers in artificial intelligence and applications(pp.\u00a0735\u2013760). Amsterdam: IOS Press."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9218-x"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Cayrol C. & Lagasquie-Schiex M. (2005). On the acceptability of arguments in bipolar argumentation frameworks. In L. Godo (Ed.),Proceedings of the Eighth European conference on symbolic and quantitative approaches to reasoning with uncertainty, ECSQARU 2005, Vol. 3571 ofLecture notes in computer science(pp.\u00a0378\u2013389). Berlin: Springer.","DOI":"10.1007\/11518655_33"},{"key":"CIT0012","unstructured":"Cerutti F., Dunne P.E., Giacomin M. & Vallati M. (2013). Computing preferred extensions in abstract argumentation: A SAT-based approach. In E. Black, S. Modgil, & N. Oren (Eds.),Proceedings of the second international workshop of theory and applications of formal argumentation, TAFA-2013, Vol. 8306 ofLecture notes in computer science(pp.\u00a0176\u2013193). Berlin: Springer."},{"key":"CIT0013","unstructured":"Cerutti F., Giacomin M., Vallati M. & Zanella M. (2014). An SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation. In C. Baral, G.D. Giacomo, & T. Eiter (Eds.),Proceedings of the fourteenth international conference on principles of knowledge representation and reasoning, KR 2014. Palo Alto, CA: AAAI Press."},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.008"},{"key":"CIT0015","unstructured":"Diller M. (2014).Solving reasoning problems on abstract dialectical frameworks via quantified Boolean formulas(Master's thesis, Vienna University of Technology, Institute of Information Systems)."},{"key":"CIT0016","unstructured":"Diller M., Wallner J.P. & Woltran S. (2014). Reasoning in abstract dialectical frameworks using quantified Boolean formulas. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.),Proceedings of the fifth international conference on computational models of argument, COMMA-2014, Vol. 266 ofFrontiers in artificial intelligence and applications(pp.\u00a0241\u2013252). Amsterdam: IOS Press."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00261-8"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.10.001"},{"key":"CIT0020","unstructured":"Egly U., Eiter T., Tompits H. & Woltran S. (2000). Solving advanced reasoning tasks using quantified Boolean formulas. In H.A. Kautz & B.W. Porter (Eds.),Proceedings of the seventeenth national conference on artificial intelligence and twelfth conference on on innovative applications of artificial intelligence (AAAI\/IAAI-2000)(pp.\u00a0417\u2013422). Palo Alto, CA: AAAI Press \/ The MIT Press."},{"key":"CIT0021","unstructured":"Egly U. & Woltran S. (2006). Reasoning in argumentation frameworks using quantified boolean formulas. In P.E. Dunne & T.J.M. Bench-Capon (Eds.),Proceedings of the first conference on computational models of argument, COMMA 2006, Vol. 144 ofFrontiers in artificial intelligence and applications, Liverpool, (pp.\u00a0133\u2013144)."},{"key":"CIT0022","unstructured":"Ellmauthaler S. & Strass H. (2013). The DIAMOND system for argumentation: Preliminary report. In M. Fink & Y. Lierler (Eds.),Proceedings of the sixth international workshop on answer set programming and other computing paradigms, ASPOCP 2013, Istanbul (pp.\u00a097\u2013108)."},{"key":"CIT0023","unstructured":"Ellmauthaler S. & Strass H. (2014). The DIAMOND system for computing with abstract dialectical frameworks. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.),Proceedings of the fifth international conference on computational models of argument, COMMA-2014, Vol. 266 ofFrontiers in artificial intelligence and applications(pp.\u00a0233\u2013240). Amsterdam: IOS Press."},{"key":"CIT0024","unstructured":"Ferraris P. & Giunchiglia E. (2000). Planning as satisfiability in nondeterministic domains. In H.A. Kautz & B.W. Porter (Eds.),Proceedings of the seventeenth national conference on artificial intelligence and twelfth conference on innovative applications of artificial intelligence, AAAI\/IAAI-2000(pp.\u00a0748\u2013753). Palo Alto, CA: AAAI Press \/ The MIT Press."},{"key":"CIT0025","unstructured":"Franco J. & Martin J. (2009). A history of satisfiability. In A. Biere, M. Heule, H. van Maaren, & T. Walsh (Eds.),Handbook of satisfiability, Vol. 185 ofFrontiers in artificial intelligence and applications(pp.\u00a03\u201374). Amsterdam: IOS Press."},{"key":"CIT0026","unstructured":"Giunchiglia E., Marin P. & Narizzano M. (2009). Reasoning with quantified Boolean formulas. In A. Biere, M. Heule, H. van Maaren, & T. Walsh (Eds.),Handbook of satisfiability, Vol. 185 ofFrontiers in artificial intelligence and applications(pp.\u00a0761\u2013780). Amsterdam: IOS Press."},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888264"},{"key":"CIT0028","doi-asserted-by":"crossref","unstructured":"Ling A.C., Singh D.P. & Brown S.D. (2005). FPGA logic synthesis using quantified boolean satisfiability. In F. Bacchus & T. Walsh (Eds.),Proceedings of the eighth international conference on theory and applications of satisfiability testing, SAT 2005, Vol. 3569 ofLecture notes in computer science(pp.\u00a0444\u2013450). Berlin: Springer.","DOI":"10.1007\/11499107_37"},{"key":"CIT0029","doi-asserted-by":"crossref","unstructured":"Lonsing F. & Egly U. (2014). Incremental QBF solving. In B. O'Sullivan (Ed.),Principles and practice of constraint programming \u2013 Proceedings of the 20th international conference, CP 2014, Vol. 8656 ofLecture notes in computer science(pp.\u00a0514\u2013530). Berlin: Springer.","DOI":"10.1007\/978-3-319-10428-7_38"},{"key":"CIT0030","unstructured":"Lonsing F. & Seidl M. (Eds.) (2013).Informal workshop report on the international workshop on quantified Boolean formulas 2013."},{"key":"CIT0031","unstructured":"Mneimneh M.N. & Sakallah K.A. (2003). Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In E. Giunchiglia & A. Tacchella (Eds.),Proceedings of the sixth international conference on theory and applications of satisfiability testing (SAT-2003), Vol. 2919 ofLecture notes in computer science(pp.\u00a0411\u2013425). Berlin: Springer."},{"key":"CIT0032","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"Rintanen J.","year":"1999","journal-title":"Journal of Artificial Intelligence Research"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.004"},{"key":"CIT0034","unstructured":"Strass H. & Wallner J.P. (2014). Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory. In C. Baral, G.D. Giacomo, & T. Eiter (Eds.),Proceedings of the 14th international conference on principles of knowledge representation and reasoning, KR 2014(pp.\u00a0101\u2013110). Palo Alto, CA: AAAI Press."},{"key":"CIT0035","unstructured":"Wallner J. P. (2014).Complexity results and algorithms for argumentation \u2013 Dung's frameworks and beyond(PhD thesis, Vienna University of Technology, Institute of Information Systems)."}],"container-title":["Argument & Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/19462166.2015.1036922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T09:21:07Z","timestamp":1741684867000},"score":1,"resource":{"primary":{"URL":"http:\/\/content.iospress.com\/doi\/10.1080\/19462166.2015.1036922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,4]]},"references-count":35,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2014,5,23]]},"published-print":{"date-parts":[[2015,5,4]]}},"alternative-id":["10.1080\/19462166.2015.1036922"],"URL":"https:\/\/doi.org\/10.1080\/19462166.2015.1036922","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"type":"print","value":"1946-2166"},{"type":"electronic","value":"1946-2174"}],"subject":[],"published":{"date-parts":[[2015,5,4]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tarc20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tarc20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}