{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:28:55Z","timestamp":1776680935331,"version":"3.51.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030867713","type":"print"},{"value":"9783030867720","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86772-0_13","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T11:05:54Z","timestamp":1632222354000},"page":"173-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Assumption-Based Argumentation Is Logic Programming with Projection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6593-5788","authenticated-orcid":false,"given":"Samy","family":"S\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4297-2970","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Alc\u00e2ntara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,19]]},"reference":[{"issue":"5\u20136","key":"13_CR1","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1017\/S1471068419000280","volume":"19","author":"JFL Alc\u00e2ntara","year":"2019","unstructured":"Alc\u00e2ntara, J.F.L., S\u00e1, S., Guadarrama, J.C.A.: On the equivalence between abstract dialectical frameworks and logic programs. Theory Pract. Log. Program. 19(5\u20136), 941\u2013956 (2019)","journal-title":"Theory Pract. Log. Program."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bondarenko, A., Dung, P., Kowalski, R., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. AI 93, 63\u2013101 (1997)","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Caminada, M., Harikrishnan, S., S\u00e1, S.: Comparing logic programming and formal argumentation; the case of ideal and eager semantics. Argum. Comput. (Preprint), 1\u201328 (2020)","DOI":"10.3233\/AAC-200528"},{"key":"13_CR4","unstructured":"Caminada, M., S\u00e1, S., Alc\u00e2ntara, J., Dvor\u00e1k, W.: On the difference between assumption-based argumentation and abstract argumentation. IfCoLog J. Logics Appl. 2, 15\u201334 (2015). http:\/\/www.collegepublications.co.uk\/journals\/ifcolog\/?00003"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ijar.2014.12.004","volume":"58","author":"M Caminada","year":"2015","unstructured":"Caminada, M., S\u00e1, S., Alc\u00e2ntara, J., Dvor\u00e1k, W.: On the equivalence between logic programming semantics and argumentation semantics. Int. J. Approx. Reason. 58, 87\u2013111 (2015)","journal-title":"Int. J. Approx. Reason."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1613\/jair.5581","volume":"60","author":"M Caminada","year":"2017","unstructured":"Caminada, M., Schulz, C.: On the equivalence between assumption-based argumentation and logic programming. J. Artif. Intell. Res. 60, 779\u2013825 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Clark, K.L.: Negation as failure. In: Logic and Data Bases, pp. 293\u2013322. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/978-1-4684-3384-5_11","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-0-387-98197-0_10","volume-title":"Argumentation in Artificial Intelligence","author":"P Dung","year":"2009","unstructured":"Dung, P., Kowalski, R., Toni, F.: Assumption-based argumentation. In: Simari, G., Rahwan, I. (eds.) Argumentation in Artificial Intelligence, pp. 199\u2013218. Springer, US (2009). https:\/\/doi.org\/10.1007\/978-0-387-98197-0_10"},{"issue":"1\u20132","key":"13_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1018947420290","volume":"19","author":"T Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Sacca, D.: On the partial semantics for disjunctive deductive databases. Ann. Math. Artif. Intell. 19(1\u20132), 59\u201396 (1997)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Lloyd, J.W.: Foundations of Logic Programming; (2nd extended ed.). Springer-Verlag, New York Inc., New York (1987). https:\/\/doi.org\/10.1007\/978-3-642-83189-8","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T Przymusinski","year":"1990","unstructured":"Przymusinski, T.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13(4), 445\u2013463 (1990)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"TC Przymusinski","year":"1991","unstructured":"Przymusinski, T.C.: Stable semantics for disjunctive programs. New Gener. Comput. 9, 401\u2013424 (1991)","journal-title":"New Gener. Comput."},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"S\u00e1, S., Alc\u00e2ntara, J.: Interpretations and models for assumption-based argumentation. In: Proceedings of the 34rd Annual ACM Symposium on Applied Computing. SAC \u201919, ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3297280.329739","DOI":"10.1145\/3297280.329739"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Schulz, C., Toni, F.: Complete assumption labellings. In: Computational Models of Argument - Proceedings of COMMA 2014, Atholl Palace Hotel, Scottish Highlands, UK, 9\u201312 September 2014, pp. 405\u2013412 (2014). https:\/\/doi.org\/10.3233\/978-1-61499-436-7-405","DOI":"10.3233\/978-1-61499-436-7-405"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/19462166.2013.869878","volume":"5","author":"F Toni","year":"2014","unstructured":"Toni, F.: A tutorial on assumption-based argumentation. Argum. Comput. 5(1), 89\u2013117 (2014)","journal-title":"Argum. Comput."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Wu, Y., Caminada, M., Gabbay, D.: Complete extensions in argumentation coincide with 3-valued stable models in logic programming. Studia Logica 93(1\u20132), 383\u2013403 (2009). Special issue: new ideas in argumentation theory","DOI":"10.1007\/s11225-009-9210-5"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86772-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T10:08:01Z","timestamp":1635761281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86772-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030867713","9783030867720"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86772-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSQARU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Symbolic and Quantitative Approaches with Uncertainty","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","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":"ecsqaru2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecsqaru.utia.cas.cz\/","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":"63","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":"48","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":"0","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":"76% - 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.95","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.25","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)"}}]}}