{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:38:45Z","timestamp":1762101525054,"version":"3.40.4"},"reference-count":59,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1093\/logcom\/exu008","type":"journal-article","created":{"date-parts":[[2014,2,15]],"date-time":"2014-02-15T02:30:02Z","timestamp":1392431402000},"page":"1315-1360","source":"Crossref","is-referenced-by-count":10,"title":["RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics"],"prefix":"10.1093","volume":"26","author":[{"given":"Teresa","family":"Alsinet","sequence":"first","affiliation":[]},{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"additional","affiliation":[]},{"given":"Llu\u00eds","family":"Godo","sequence":"additional","affiliation":[]},{"given":"Francesc","family":"Guitart","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2014,2,14]]},"reference":[{"key":"2016072605081221000_26.4.1315.1","first-page":"27","article-title":"A characterization of collective conflict for defeasible argumentation","volume-title":"Computational Models of Argument: Proceedings of COMMA 2010","volume":"216","author":"Alsinet","year":"2010"},{"key":"2016072605081221000_26.4.1315.2","doi-asserted-by":"crossref","unstructured":"Alsinet T. B\u00e9jar R. Godo L. Guitart F. Maximal ideal recursive semantics for defeasible argumentation. Proceedings of the 5th International Conference on Scalable Uncertainty Management (SUM 2011) 2011:96-109.","DOI":"10.1007\/978-3-642-23963-2_9"},{"key":"2016072605081221000_26.4.1315.3","doi-asserted-by":"crossref","unstructured":"Alsinet T. B\u00e9jar R. Godo L. Guitart F. Using answer set programming for an scalable implementation of defeasible argumentation. In In Proceedings of 24th IEEE International Conference on Tools with Artificial Intelligence (ICTAI) 2012:1016-1021.","DOI":"10.1109\/ICTAI.2012.171"},{"key":"2016072605081221000_26.4.1315.4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2007.07.004"},{"key":"2016072605081221000_26.4.1315.5","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2007.12.013"},{"key":"2016072605081221000_26.4.1315.6","unstructured":"Amgoud L. Postulates for logic-based argumentation systems. Proceedings of the ECAI-2012 Workshop WL4AI 2012:59-67."},{"key":"2016072605081221000_26.4.1315.7","doi-asserted-by":"crossref","unstructured":"Amgoud L. Besnard P. Bridging the gap between abstract argumentation systems and logic. SUM 2009:12-27.","DOI":"10.1007\/978-3-642-04388-8_3"},{"key":"2016072605081221000_26.4.1315.8","doi-asserted-by":"crossref","unstructured":"Amgoud L. Besnard P. A formal analysis of logic-based argumentation systems. SUM 2010:42-55.","DOI":"10.1007\/978-3-642-15951-0_10"},{"key":"2016072605081221000_26.4.1315.9","unstructured":"Amgoud L. Bodenstaff L. Caminada M. McBurney P. Parsons S. Prakken H. van Veenen J. Vreeswijk G. Final review and report on formal argumentation system. Technical report 2006. Deliverable D2.6, ASPIC IST-FP6-002307 http:\/\/www.cs.bris.ac.uk\/Teaching\/Resources\/COMS70301\/RuleInduction.pdf ."},{"key":"2016072605081221000_26.4.1315.10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021603608656"},{"key":"2016072605081221000_26.4.1315.11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014490210693"},{"key":"2016072605081221000_26.4.1315.12","unstructured":"Amgoud L. Vesic S. Repairing preference-based argumentation frameworks. IJCAI 2009:665-670."},{"key":"2016072605081221000_26.4.1315.13","doi-asserted-by":"crossref","unstructured":"Amgoud L. Vesic S. COMMA. 2010. Generalizing stable semantics by preferences; p. 39-50.","DOI":"10.3233\/978-1-60750-619-5-39"},{"key":"2016072605081221000_26.4.1315.14","doi-asserted-by":"crossref","unstructured":"Amgoud L. Vesic S. SUM. 2010. Handling inconsistency with preference-based argumentation; p. 56-69.","DOI":"10.1007\/978-3-642-15951-0_11"},{"key":"2016072605081221000_26.4.1315.15","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9271-9"},{"key":"2016072605081221000_26.4.1315.16","doi-asserted-by":"crossref","unstructured":"Apt K. R. Blair H. A. Walker A. ; Minker J. , editor. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming Morgan Kaufmann; 1988:89-148.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"2016072605081221000_26.4.1315.17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2013.03.009"},{"key":"2016072605081221000_26.4.1315.18","unstructured":"Audemard G. Simon L. Predicting learnt clauses quality in modern sat solvers. Proceedings of the 21st International Jont Conference on Artifical intelligence San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.; 2009:399-404. IJCAI'09."},{"key":"2016072605081221000_26.4.1315.19","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.3.429"},{"key":"2016072605081221000_26.4.1315.20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014537925523"},{"key":"2016072605081221000_26.4.1315.21","unstructured":"Benferhat S. Cayrol C. Dubois D. Lang J. Prade H. Proceedings of IJCAI 1993. 1993. Inconsistency management and prioritized syntax-based entailment; p. 640-647."},{"key":"2016072605081221000_26.4.1315.22","doi-asserted-by":"crossref","unstructured":"Benferhat S. Dubois D. Prade H. Argumentative inference in uncertain and inconsistent knowledge base. Proceedings of the 9th Annual Conference on Uncertainty in Artificial Intelligence (UAI-93) San Francisco, CA: Morgan Kaufmann; 1993:411-419.","DOI":"10.1016\/B978-1-4832-1451-1.50054-8"},{"key":"2016072605081221000_26.4.1315.23","unstructured":"Benferhat S. Dubois D. Prade H. Proceedings of IJCAI 1995. 1995. How to infer from inconsisent beliefs without revising?; p. 1449-1457."},{"key":"2016072605081221000_26.4.1315.24","doi-asserted-by":"crossref","unstructured":"Benferhat S. Dubois D. Prade H. Proceedings of the 26th International Symposium on Multiple-Valued Logic, (ISMVL-93). IEEE Press; 1996. Reasoning in inconsistent stratified knowledge bases; p. 184-189.","DOI":"10.1109\/ISMVL.1996.508357"},{"key":"2016072605081221000_26.4.1315.25","unstructured":"Besnard P. Doutre S. 10th International Workshop on Non-Monotonic Reasoning (NMR 2004). 2004. Checking the acceptability of a set of arguments; p. 59-64."},{"key":"2016072605081221000_26.4.1315.26","doi-asserted-by":"crossref","unstructured":"Besnard P. Hunter A. Elements of Argumentation. The MIT Press; 2008.","DOI":"10.7551\/mitpress\/9780262026437.001.0001"},{"key":"2016072605081221000_26.4.1315.27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.06.006"},{"key":"2016072605081221000_26.4.1315.28","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"2016072605081221000_26.4.1315.29","unstructured":"Brewka G. Proceedings of IJCAI 1989. 1989. Preferred subtheories: an extended logical framework for default reasoning; p. 1043-1048."},{"key":"2016072605081221000_26.4.1315.30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.003"},{"key":"2016072605081221000_26.4.1315.31","unstructured":"Cecchi L. A. Fillottrani P. R. Simari Guillermo R. On the complexity of DeLP through game semantics. Proceedings of 11th International Workshop on Nonmonotonic Reasoning (NMR 2006) 2006:386-394. May."},{"key":"2016072605081221000_26.4.1315.32","doi-asserted-by":"publisher","DOI":"10.1145\/371578.371581"},{"key":"2016072605081221000_26.4.1315.33","doi-asserted-by":"crossref","unstructured":"Ches\u00f1evar C. I. Simari G. R. Godo L. LPNMR. 2005. Computing dialectical trees efficiently in possibilistic defeasible logic programming; p. 158-171.","DOI":"10.1007\/11546207_13"},{"key":"2016072605081221000_26.4.1315.34","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"2016072605081221000_26.4.1315.35","first-page":"145","article-title":"A dialectic procedure for sceptical, assumption-based argumentation","volume":"172","author":"Dung","year":"2006","journal-title":"Computational Models of Argument: Proceedings of COMMA 2008"},{"key":"2016072605081221000_26.4.1315.36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"2016072605081221000_26.4.1315.37","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.09.001"},{"key":"2016072605081221000_26.4.1315.38","unstructured":"Dvor\u00e1k W. Dunne Paul E. Woltran S. IJCAI. 2011. Parametric properties of ideal semantics; p. 851-856."},{"key":"2016072605081221000_26.4.1315.39","first-page":"502","article-title":"An extensible sat-solver","volume-title":"SAT","volume":"2919","author":"E\u00e9n","year":"2003"},{"key":"2016072605081221000_26.4.1315.40","unstructured":"Egly U. Woltran S. Computational Models of Argument: Proceedings of COMMA 2006. 2006. Reasoning in argumentation frameworks using quantified boolean formulas; p. 133-144."},{"key":"2016072605081221000_26.4.1315.41","doi-asserted-by":"crossref","unstructured":"Garc\u00eda A. J. Dix J. Simari G. R. Argument-based logic programming. In: Rahwan I. Simari G. R. , editors. Argumentation in Artificial Intelligence. Springer; 2009. p. 153-171. Chap. 8.","DOI":"10.1007\/978-0-387-98197-0_8"},{"key":"2016072605081221000_26.4.1315.42","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001674"},{"key":"2016072605081221000_26.4.1315.43","unstructured":"Gomes C. P. Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence. 2000. Structure, duality, and randomization: common themes in ai and or; p. 1152-1158."},{"key":"2016072605081221000_26.4.1315.44","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.5.675"},{"key":"2016072605081221000_26.4.1315.45","first-page":"1","article-title":"Structure and problem hardness: goal asymmetry and dpll proofs in sat-based planning","volume":"3","author":"Hoffmann","year":"2007","journal-title":"Logical Methods in Computer Science (LMCS)"},{"key":"2016072605081221000_26.4.1315.46","unstructured":"Kaci S. COMMA. 2010. Refined preference-based argumentation frameworks; p. 299-310."},{"key":"2016072605081221000_26.4.1315.47","doi-asserted-by":"crossref","unstructured":"Kautz H. A. Ruan Y. Achlioptas D. Gomes C. P. Selman B. Stickel M. E. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001. 2001. Balance and filtering in structured satisfiable problems; p. 351-358.","DOI":"10.1016\/S1571-0653(04)00310-5"},{"key":"2016072605081221000_26.4.1315.48","unstructured":"Kautz H. A. Selman B. IJCAI. 1999. Unifying sat-based and graph-based planning; p. 318-325."},{"key":"2016072605081221000_26.4.1315.49","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.02.001"},{"key":"2016072605081221000_26.4.1315.50","unstructured":"Modgil S. Prakken H. IJCAI. 2011. Revisiting preferences and argumentation; p. 1021-1026."},{"key":"2016072605081221000_26.4.1315.51","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.10.008"},{"key":"2016072605081221000_26.4.1315.52","doi-asserted-by":"crossref","unstructured":"Nielsen S. H. Parsons S. ArgMAS. 2006. A generalization of Dung's abstract framework for argumentation: arguing with sets of attacking arguments; p. 54-73.","DOI":"10.1007\/978-3-540-75526-5_4"},{"key":"2016072605081221000_26.4.1315.53","doi-asserted-by":"crossref","unstructured":"Pollock J. L. A recursive semantics for defeasible reasoning. In: Rahwan I. Simari G. R. , editors. Argumentation in Artificial Intelligence. Springer; 2009. p. 173-198. Chap. 9.","DOI":"10.1007\/978-0-387-98197-0_9"},{"key":"2016072605081221000_26.4.1315.54","doi-asserted-by":"publisher","DOI":"10.1080\/19462160903564592"},{"key":"2016072605081221000_26.4.1315.55","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.1997.10510900"},{"key":"2016072605081221000_26.4.1315.56","doi-asserted-by":"crossref","unstructured":"Prakken H. Vreeswijk G. Logical systems for defeasible argumentation. In: Gabbay D. Guenther F. , editors. Handbook of Philosophical Logic. Kluwer; 2002. p. 219-318.","DOI":"10.1007\/978-94-017-0456-4_3"},{"key":"2016072605081221000_26.4.1315.57","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90069-A"},{"key":"2016072605081221000_26.4.1315.58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20832-4_11"},{"key":"2016072605081221000_26.4.1315.59","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00041-0"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/26\/4\/1315\/7949977\/exu008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T21:23:37Z","timestamp":1746134617000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exu008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,14]]},"references-count":59,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2016,7,25]]},"published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1093\/logcom\/exu008"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exu008","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published":{"date-parts":[[2014,2,14]]}}}