{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:51:56Z","timestamp":1773939116127,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157066","type":"print"},{"value":"9783031157073","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15707-3_14","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"177-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Representing Abstract Dialectical Frameworks with\u00a0Binary Decision Diagrams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3882-4286","authenticated-orcid":false,"given":"Stefan","family":"Ellmauthaler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2425-6089","authenticated-orcid":false,"given":"Sarah Alice","family":"Gaggl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3172-5827","authenticated-orcid":false,"given":"Dominik","family":"Rusovac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3051-1966","authenticated-orcid":false,"given":"Johannes P.","family":"Wallner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10506-016-9178-1","volume":"24","author":"L Al-Abdulkarim","year":"2016","unstructured":"Al-Abdulkarim, L., Atkinson, K., Bench-Capon, T.J.M.: A methodology for designing systems to reason with legal cases using abstract dialectical frameworks. Artif. Intell. Law 24(1), 1\u201349 (2016)","journal-title":"Artif. Intell. Law"},{"issue":"3","key":"14_CR2","first-page":"25","volume":"38","author":"K Atkinson","year":"2017","unstructured":"Atkinson, K., et al.: Towards artificial argumentation. AI Mag. 38(3), 25\u201336 (2017)","journal-title":"AI Mag."},{"key":"14_CR3","unstructured":"Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation. College Publications (2018)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-030-53288-8_28","volume-title":"Computer Aided Verification","author":"N Bene\u0161","year":"2020","unstructured":"Bene\u0161, N., Brim, L., Kadlecaj, J., Pastva, S., \u0160afr\u00e1nek, D.: AEON: attractor bifurcation analysis of parametrised Boolean networks. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 569\u2013581. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_28"},{"issue":"9","key":"14_CR5","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993\u20131002 (1996)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1017\/S1471068419000474","volume":"20","author":"G Brewka","year":"2020","unstructured":"Brewka, G., Diller, M., Heissenberger, G., Linsbichler, T., Woltran, S.: Solving advanced argumentation problems with answer set programming. Theory Pract. Log. Program. 20(3), 391\u2013431 (2020)","journal-title":"Theory Pract. Log. Program."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J.P., Woltran., S.: Abstract dialectical frameworks. In Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, pp. 237\u2013285. College Publications (2018)","DOI":"10.1609\/aaai.v32i1.11545"},{"issue":"8","key":"14_CR8","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Cabrio, E., Villata, S.: Abstract dialectical frameworks for text exploration. In: Proceedings of ICAART, pp. 85\u201395. SciTePress (2016)","DOI":"10.5220\/0005699100850095"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1080\/19462166.2015.1036922","volume":"6","author":"M Diller","year":"2015","unstructured":"Diller, M., Wallner, J.P., Woltran, S.: Reasoning in abstract dialectical frameworks using quantified Boolean formulas. Argument Comput. 6(2), 149\u2013177 (2015)","journal-title":"Argument Comput."},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"key":"14_CR13","unstructured":"Dvo\u0159\u00e1k, W., Dunne, P.E.: Computational problems in formal argumentation and their complexity. In: Baroni, P., Gabbay, D., Giacomin, M., van der Torre, L. (eds.) Handbook of Formal Argumentation, pp. 631\u2013688. College Publications (2018)"},{"key":"14_CR14","unstructured":"Ellmauthaler, S., Wallner, J.P.: Evaluating Abstract Dialectical Frameworks with ASP. In: Proceedings of COMMA, vol. 245, pp. 505\u2013506. IOS Press (2012)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Fichte, J.K., Gaggl, S.A., Rusovac, D.: Rushing and strolling among answer sets - navigation made easy. In: Proceedings of AAAI (2022)","DOI":"10.1609\/aaai.v36i5.20506"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1.11348","volume":"70","author":"SA Gaggl","year":"2021","unstructured":"Gaggl, S.A., Rudolph, S., Stra\u00df, H.: On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics. J. Artif. Intell. Res. 70, 1\u201364 (2021)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10115-012-0525-6","volume":"35","author":"Y Lai","year":"2013","unstructured":"Lai, Y., Liu, D., Wang, S.: Reduced ordered binary decision diagram with implied literals: a new knowledge compilation approach. Knowl. Inf. Syst. 35(3), 665\u2013712 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"103697","DOI":"10.1016\/j.artint.2022.103697","volume":"307","author":"T Linsbichler","year":"2022","unstructured":"Linsbichler, T., Maratea, M., Niskanen, A., Wallner, J.P., Woltran, S.: Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. Artif. Intell. 307, 103697 (2022)","journal-title":"Artif. Intell."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: A 25-Year Perspective. Artificial Intelligence, pp. 375\u2013398 (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"14_CR20","unstructured":"Neugebauer, D.: Generating defeasible knowledge bases from real-world argumentations using D-BAS. In: Proceedings of AI $$\\hat{\\,}$$3@AI*IA. Volume 2012 of CEUR Workshop Proceedings, pp. 105\u2013110. CEUR-WS.org (2017)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BFb0028562","volume-title":"STACS 98","author":"D Sieling","year":"1998","unstructured":"Sieling, D.: On the existence of polynomial time approximation schemes for OBDD minimization. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 205\u2013215. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028562"},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1093\/logcom\/exv004","volume":"28","author":"H Strass","year":"2018","unstructured":"Strass, H.: Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond. J. Log. Comput. 28(3), 605\u2013627 (2018)","journal-title":"J. Log. Comput."},{"key":"14_CR23","unstructured":"Strass, H., Ellmauthaler, S.: goDIAMOND 0.6.6 - ICCMA 2017 system description. In: 2nd ICCMA (2017)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.artint.2015.05.003","volume":"226","author":"H Strass","year":"2015","unstructured":"Strass, H., Wallner, J.P.: Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory. Artif. Intell. 226, 34\u201374 (2015)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15707-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,25]],"date-time":"2022-11-25T21:32:50Z","timestamp":1669411970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15707-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15707-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genoa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2022.dibris.unige.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}