{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:10Z","timestamp":1761611110394},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0004-3702(03)00076-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T15:39:35Z","timestamp":1056987575000},"page":"221-250","source":"Crossref","is-referenced-by-count":51,"title":["Two party immediate response disputes: Properties and efficiency"],"prefix":"10.1016","volume":"149","author":[{"given":"Paul E.","family":"Dunne","sequence":"first","affiliation":[]},{"given":"T.J.M.","family":"Bench-Capon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(03)00076-6_BIB001","series-title":"Proc. 29th Annual Symposium on Foundations of Computer Science, White Plains, NY","first-page":"346","article-title":"The complexity of the pigeonhole principle","author":"Ajtai","year":"1988"},{"issue":"2","key":"10.1016\/S0004-3702(03)00076-6_BIB002","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00881838","article-title":"Gentzen-type systems, resolutions, and tableaux","volume":"10","author":"Avron","year":"1993","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(03)00076-6_BIB003","series-title":"Proc. Twenty-Fourth Annual ACM Symposium on the Theory of Computing, Victoria, BC","first-page":"200","article-title":"Exponential lower bounds for the pigeonhole principle","author":"Beame","year":"1992"},{"issue":"3","key":"10.1016\/S0004-3702(03)00076-6_BIB004","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0168-0072(96)83747-X","article-title":"An exponential separation between the parity principle and the pigeonhole principle","volume":"80","author":"Beame","year":"1996","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB005","first-page":"66","article-title":"Propositional proof complexity: Past, present, and future","volume":"65","author":"Beame","year":"1998","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB006","series-title":"Legal Knowledge Based Systems","first-page":"5","article-title":"Specification and implementation of Toulmin dialogue game","author":"Bench-Capon","year":"1998"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB007","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(03)00076-6_BIB008","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","article-title":"An abstract, argumentation-theoretic approach to default reasoning","volume":"93","author":"Bondarenko","year":"1997","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(03)00076-6_BIB009","doi-asserted-by":"crossref","first-page":"708","DOI":"10.2307\/2275569","article-title":"Lower bounds for cutting planes proofs with small coefficients","volume":"62","author":"Bonet","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB010","series-title":"Proc. Eleventh European Conference on Artificial Intelligence","first-page":"366","article-title":"A reconstruction of Rescher's theory of formal disputation based on default logic","author":"Brewka","year":"1994"},{"issue":"4","key":"10.1016\/S0004-3702(03)00076-6_BIB011","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/0206046","article-title":"Determining the stability number of a graph","volume":"6","author":"Chv\u00e1tal","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0004-3702(03)00076-6_BIB012","doi-asserted-by":"crossref","first-page":"36","DOI":"10.2307\/2273702","article-title":"The relative complexity of propositional proof systems","volume":"44","author":"Cook","year":"1979","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB013","series-title":"Proc. IJCAI-99, Stockholm, Sweden, Vol. 1","first-page":"36","article-title":"Preferred arguments are harder to compute than stable extensions","author":"Dimopoulos","year":"1999"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB014","series-title":"Principles of Knowledge Representation and Reasoning, KR2000","first-page":"53","article-title":"Finding admissible and preferred arguments can be very hard","author":"Dimopoulos","year":"2000"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB015","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(02)00245-X","article-title":"On the computational complexity of assumption-based argumentation by default reasoning","volume":"141","author":"Dimopoulos","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB016","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","article-title":"Graph theoretical structures in logic programs and default theories","volume":"170","author":"Dimopoulos","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(03)00076-6_BIB017","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reason, logic programming, and N-person games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB018","unstructured":"P.E. Dunne, TPI-disputes and proof by clausal tableaux, Technical Report ULCS-02-008, Department of Comp. Sci., University of Liverpool, 2002"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB019","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","article-title":"Coherence in finite argument systems","volume":"141","author":"Dunne","year":"2002","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB020","series-title":"Proc. IJCAI-91, Sydney, Australia","first-page":"99","article-title":"A resolution method for temporal logic","author":"Fisher","year":"1991"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB021","series-title":"The Collected Papers of Gerhard Gentzen","first-page":"68","article-title":"Investigations into logical deductions, 1935","author":"Gentzen","year":"1969"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB022","series-title":"The Pleadings Game: An Artificial Intelligence Model of Procedural Justice","author":"Gordon","year":"1995"},{"issue":"2\u20133","key":"10.1016\/S0004-3702(03)00076-6_BIB023","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(03)00076-6_BIB024","series-title":"Proc. Seventh International Conference on Artificial Intelligence and Law (ICAIL-99), ACM SIGART","first-page":"53","article-title":"Dialectic semantics for argumentation frameworks","author":"Jakobovits","year":"1999"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB025","doi-asserted-by":"crossref","unstructured":"A.R. Lodder, Dialaw: On legal justification and Dialogue Games, PhD Thesis, University of Maastricht, 1998","DOI":"10.1007\/978-94-011-3957-1"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB026","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/0824-7935.00055","article-title":"Process and policy: Resource-bounded nondemonstrative reasoning","volume":"14","author":"Loui","year":"1998","journal-title":"COMPINT: Computational Intelligence: An Internat. J."},{"issue":"1","key":"10.1016\/S0004-3702(03)00076-6_BIB027","first-page":"117","article-title":"Question-begging in non-cumulative systems","volume":"8","author":"MacKenzie","year":"1978","journal-title":"J. Philos. Logic"},{"issue":"3","key":"10.1016\/S0004-3702(03)00076-6_BIB028","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/S089548019224024X","article-title":"The complexity of the Haj\u00f3s calculus","volume":"8","author":"Pitassi","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0004-3702(03)00076-6_BIB029","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/11663081.1997.10510900","article-title":"Argument-based extended logic programming with defeasible priorities","volume":"7","author":"Prakken","year":"1997","journal-title":"J. Appl. Non-Classical Logics"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB030","series-title":"Handbook of Proof Theory","article-title":"The lengths of proofs","volume":"137","author":"Pudl\u00e1k","year":"1998"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB031","series-title":"Sets and Proofs, Invited papers from Logic Colloquium'97","first-page":"197","article-title":"On the complexity of propositional calculus","author":"Pudl\u00e1k","year":"1999"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB032","series-title":"Proc. 3rd International Conference on Multi-Agent Systems (ICMAS-98)","first-page":"246","article-title":"Dialogue frames in agent communications","author":"Reed","year":"1998"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB033","series-title":"First-order Logic","author":"Smullyan","year":"1968"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB034","series-title":"The Uses of Argument","author":"Toulmin","year":"1959"},{"issue":"1","key":"10.1016\/S0004-3702(03)00076-6_BIB035","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0304-3975(89)90147-3","article-title":"The complexity of Gentzen systems for propositional logic","volume":"66","author":"Urquhart","year":"1989","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0004-3702(03)00076-6_BIB036","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2178\/bsl\/1203350879","article-title":"The complexity of propositional proofs","volume":"1","author":"Urquhart","year":"1995","journal-title":"Bull. Symbolic Logic"},{"issue":"3","key":"10.1016\/S0004-3702(03)00076-6_BIB037","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/logcom\/3.3.317","article-title":"Defeasible dialectics: A controversy-oriented approach towards defeasible argumentation","volume":"3","author":"Vreeswijk","year":"1993","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(03)00076-6_BIB038","series-title":"Proc. JELIA'2000, The 7th European Workshop on Logic for Artificial Intelligence","first-page":"224","article-title":"Credulous and sceptical argument games for preferred semantics","volume":"1919","author":"Vreeswijk","year":"2000"},{"key":"10.1016\/S0004-3702(03)00076-6_BIB039","series-title":"Committment in Dialogue: Basic Concepts of Interpersonal Reasoning","author":"Walton","year":"1995"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370203000766?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370203000766?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T09:44:48Z","timestamp":1585043088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370203000766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0004370203000766"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(03)00076-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}