Handling Enthymemes in Time-Limited Persuasion Dialogs
Identifieur interne : 001C56 ( Istex/Corpus ); précédent : 001C55; suivant : 001C57Handling Enthymemes in Time-Limited Persuasion Dialogs
Auteurs : Dupin De Saint-CyrSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: This paper is a first attempt to define a framework to handle enthymeme in a time-limited persuasion dialog. The notion of incomplete argument is explicited and a protocol is proposed to regulate the utterances of a persuasion dialog with respect to the three criteria of consistency, non-redundancy and listening. This protocol allows the use of enthymemes concerning the support or conclusion of the argument, enables the agent to retract or re-specify an argument. The system is illustrated on a small example and some of its properties are outlined.
Url:
DOI: 10.1007/978-3-642-23963-2_13
Links to Exploration step
ISTEX:13AA74D1B6AC3D9695D2373D87C730D3739F5990Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Handling Enthymemes in Time-Limited Persuasion Dialogs</title><author><name sortKey="De Saint Cyr, Dupin" sort="De Saint Cyr, Dupin" uniqKey="De Saint Cyr D" first="Dupin" last="De Saint-Cyr">Dupin De Saint-Cyr</name><affiliation><mods:affiliation>IRIT, Toulouse, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:13AA74D1B6AC3D9695D2373D87C730D3739F5990</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-23963-2_13</idno><idno type="url">https://api.istex.fr/document/13AA74D1B6AC3D9695D2373D87C730D3739F5990/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001C56</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Handling Enthymemes in Time-Limited Persuasion Dialogs</title><author><name sortKey="De Saint Cyr, Dupin" sort="De Saint Cyr, Dupin" uniqKey="De Saint Cyr D" first="Dupin" last="De Saint-Cyr">Dupin De Saint-Cyr</name><affiliation><mods:affiliation>IRIT, Toulouse, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">13AA74D1B6AC3D9695D2373D87C730D3739F5990</idno><idno type="DOI">10.1007/978-3-642-23963-2_13</idno><idno type="ChapterID">Chap13</idno><idno type="ChapterID">13</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper is a first attempt to define a framework to handle enthymeme in a time-limited persuasion dialog. The notion of incomplete argument is explicited and a protocol is proposed to regulate the utterances of a persuasion dialog with respect to the three criteria of consistency, non-redundancy and listening. This protocol allows the use of enthymemes concerning the support or conclusion of the argument, enables the agent to retract or re-specify an argument. The system is illustrated on a small example and some of its properties are outlined.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Florence Dupin de Saint-Cyr</name><affiliations><json:string>IRIT, Toulouse, France</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: This paper is a first attempt to define a framework to handle enthymeme in a time-limited persuasion dialog. The notion of incomplete argument is explicited and a protocol is proposed to regulate the utterances of a persuasion dialog with respect to the three criteria of consistency, non-redundancy and listening. This protocol allows the use of enthymemes concerning the support or conclusion of the argument, enables the agent to retract or re-specify an argument. The system is illustrated on a small example and some of its properties are outlined.</abstract><qualityIndicators><score>7.568</score><pdfVersion>1.6</pdfVersion><pdfPageSize>429.442 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>563</abstractCharCount><pdfWordCount>7019</pdfWordCount><pdfCharCount>34632</pdfCharCount><pdfPageCount>14</pdfPageCount><abstractWordCount>89</abstractWordCount></qualityIndicators><title>Handling Enthymemes in Time-Limited Persuasion Dialogs</title><chapterId><json:string>Chap13</json:string><json:string>13</json:string></chapterId><genre><json:string>conference [research-article]</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><genre></genre><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2011</copyrightDate></serie><host><editor><json:item><name>Salem Benferhat</name><affiliations><json:string>CRIL-CNRS, University of Artois, 62307, France</json:string><json:string>E-mail: benferhat@cril.fr</json:string></affiliations></json:item><json:item><name>John Grant</name><affiliations><json:string>Department of Mathematics, Towson University, 21252, Towson, MD, USA</json:string><json:string>E-mail: jgrant@towson.edu</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Information Systems Applications (incl. Internet)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Data Mining and Knowledge Discovery</value></json:item></subject><isbn><json:string>978-3-642-23962-5</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Scalable Uncertainty Management</title><bookId><json:string>978-3-642-23963-2</json:string></bookId><volume>6929</volume><pages><last>162</last><first>149</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-642-23963-2</json:string></eisbn><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-23963-2</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-23963-2_13</json:string></doi><id>13AA74D1B6AC3D9695D2373D87C730D3739F5990</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/13AA74D1B6AC3D9695D2373D87C730D3739F5990/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/13AA74D1B6AC3D9695D2373D87C730D3739F5990/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/13AA74D1B6AC3D9695D2373D87C730D3739F5990/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Handling Enthymemes in Time-Limited Persuasion Dialogs</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2011</date></publicationStmt><notesStmt><note>This work was funded by the ANR project LELIE on risk analysis and prevention (http://www.irit.fr/recherches/ILPL/lelie/accueil.html).</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Handling Enthymemes in Time-Limited Persuasion Dialogs</title><author><persName><forename type="first">Florence</forename><surname>de Saint-Cyr</surname></persName><affiliation>IRIT, Toulouse, France</affiliation></author></analytic><monogr><title level="m">Scalable Uncertainty Management</title><title level="m" type="sub">5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings</title><idno type="pISBN">978-3-642-23962-5</idno><idno type="eISBN">978-3-642-23963-2</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-23963-2</idno><idno type="BookID">978-3-642-23963-2</idno><idno type="BookTitleID">273167</idno><idno type="BookSequenceNumber">6929</idno><idno type="BookVolumeNumber">6929</idno><idno type="BookChapterCount">43</idno><editor><persName><forename type="first">Salem</forename><surname>Benferhat</surname></persName><email>benferhat@cril.fr</email><affiliation>CRIL-CNRS, University of Artois, 62307, France</affiliation></editor><editor><persName><forename type="first">John</forename><surname>Grant</surname></persName><email>jgrant@towson.edu</email><affiliation>Department of Mathematics, Towson University, 21252, Towson, MD, USA</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">6929</biblScope><biblScope unit="page" from="149">149</biblScope><biblScope unit="page" to="162">162</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><series><title level="s">Lecture Notes in Artificial Intelligence</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Randy</forename><surname>Goebel</surname></persName><affiliation>University of Alberta, Edmonton, Canada</affiliation></editor><editor><persName><forename type="first">Jörg</forename><surname>Siekmann</surname></persName><affiliation>University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Wolfgang</forename><surname>Wahlster</surname></persName><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation></editor><editor><persName><forename type="first">Salem</forename><surname>Benferhat</surname></persName><email>benferhat@cril.fr</email><affiliation>CRIL-CNRS, University of Artois, 62307, France</affiliation></editor><editor><persName><forename type="first">John</forename><surname>Grant</surname></persName><email>jgrant@towson.edu</email><affiliation>Department of Mathematics, Towson University, 21252, Towson, MD, USA</affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><biblScope type="seriesId">1244</biblScope></series><idno type="istex">13AA74D1B6AC3D9695D2373D87C730D3739F5990</idno><idno type="DOI">10.1007/978-3-642-23963-2_13</idno><idno type="ChapterID">Chap13</idno><idno type="ChapterID">13</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: This paper is a first attempt to define a framework to handle enthymeme in a time-limited persuasion dialog. The notion of incomplete argument is explicited and a protocol is proposed to regulate the utterances of a persuasion dialog with respect to the three criteria of consistency, non-redundancy and listening. This protocol allows the use of enthymemes concerning the support or conclusion of the argument, enables the agent to retract or re-specify an argument. The system is illustrated on a small example and some of its properties are outlined.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I21017</label><label>I18040</label><label>I18032</label><label>I13022</label><label>I18024</label><label>I18030</label><item><term>Computer Science</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Information Systems Applications (incl. Internet)</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Computer Communication Networks</term></item><item><term>Database Management</term></item><item><term>Data Mining and Knowledge Discovery</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-2">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/13AA74D1B6AC3D9695D2373D87C730D3739F5990/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Randy</GivenName><FamilyName>Goebel</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Wolfgang</GivenName><FamilyName>Wahlster</FamilyName></EditorName></Editor><Affiliation ID="Aff16"><OrgName>University of Alberta</OrgName><OrgAddress><City>Edmonton</City><Country>Canada</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>DFKI and University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-23963-2</BookID><BookTitle>Scalable Uncertainty Management</BookTitle><BookSubTitle>5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings</BookSubTitle><BookVolumeNumber>6929</BookVolumeNumber><BookSequenceNumber>6929</BookSequenceNumber><BookDOI>10.1007/978-3-642-23963-2</BookDOI><BookTitleID>273167</BookTitleID><BookPrintISBN>978-3-642-23962-5</BookPrintISBN><BookElectronicISBN>978-3-642-23963-2</BookElectronicISBN><BookChapterCount>43</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag GmbH Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl. Internet)</BookSubject><BookSubject Code="I18032" Priority="3" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I13022" Priority="4" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I18024" Priority="5" Type="Secondary">Database Management</BookSubject><BookSubject Code="I18030" Priority="6" Type="Secondary">Data Mining and Knowledge Discovery</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID><SubSeriesID>1244</SubSeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Salem</GivenName><FamilyName>Benferhat</FamilyName></EditorName><Contact><Email>benferhat@cril.fr</Email></Contact></Editor><Editor AffiliationIDS="Aff20"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><FamilyName>Grant</FamilyName></EditorName><Contact><Email>jgrant@towson.edu</Email></Contact></Editor><Affiliation ID="Aff19"><OrgName>CRIL-CNRS, University of Artois</OrgName><OrgAddress><Postcode>62307</Postcode><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgDivision>Department of Mathematics</OrgDivision><OrgName>Towson University</OrgName><OrgAddress><Postcode>21252</Postcode><City>Towson</City><State>MD</State><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartSequenceNumber>3</PartSequenceNumber><PartTitle>Argumentation Systems</PartTitle><PartChapterCount>8</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Scalable Uncertainty Management</BookTitle></PartContext></PartInfo><Chapter ID="Chap13" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>13</ChapterID><ChapterDOI>10.1007/978-3-642-23963-2_13</ChapterDOI><ChapterSequenceNumber>13</ChapterSequenceNumber><ChapterTitle Language="En">Handling Enthymemes in Time-Limited Persuasion Dialogs</ChapterTitle><ChapterFirstPage>149</ChapterFirstPage><ChapterLastPage>162</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>3</PartID><BookID>978-3-642-23963-2</BookID><BookTitle>Scalable Uncertainty Management</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Florence</GivenName><GivenName>Dupin</GivenName><Particle>de</Particle><FamilyName>Saint-Cyr</FamilyName></AuthorName></Author><Affiliation ID="Aff21"><OrgName>IRIT</OrgName><OrgAddress><City>Toulouse</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>This paper is a first attempt to define a framework to handle enthymeme in a time-limited persuasion dialog. The notion of incomplete argument is explicited and a protocol is proposed to regulate the utterances of a persuasion dialog with respect to the three criteria of consistency, non-redundancy and listening. This protocol allows the use of enthymemes concerning the support or conclusion of the argument, enables the agent to retract or re-specify an argument. The system is illustrated on a small example and some of its properties are outlined.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This work was funded by the ANR project LELIE on risk analysis and prevention (<Literal>http://www.irit.fr/recherches/ILPL/lelie/accueil.html</Literal>).</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Handling Enthymemes in Time-Limited Persuasion Dialogs</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Handling Enthymemes in Time-Limited Persuasion Dialogs</title></titleInfo><name type="personal"><namePart type="given">Florence</namePart><namePart type="given">Dupin</namePart><namePart type="family">de Saint-Cyr</namePart><affiliation>IRIT, Toulouse, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [research-article]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: This paper is a first attempt to define a framework to handle enthymeme in a time-limited persuasion dialog. The notion of incomplete argument is explicited and a protocol is proposed to regulate the utterances of a persuasion dialog with respect to the three criteria of consistency, non-redundancy and listening. This protocol allows the use of enthymemes concerning the support or conclusion of the argument, enables the agent to retract or re-specify an argument. The system is illustrated on a small example and some of its properties are outlined.</abstract><note>This work was funded by the ANR project LELIE on risk analysis and prevention (http://www.irit.fr/recherches/ILPL/lelie/accueil.html).</note><relatedItem type="host"><titleInfo><title>Scalable Uncertainty Management</title><subTitle>5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Salem</namePart><namePart type="family">Benferhat</namePart><affiliation>CRIL-CNRS, University of Artois, 62307, France</affiliation><affiliation>E-mail: benferhat@cril.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="family">Grant</namePart><affiliation>Department of Mathematics, Towson University, 21252, Towson, MD, USA</affiliation><affiliation>E-mail: jgrant@towson.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl. Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I18030">Data Mining and Knowledge Discovery</topic></subject><identifier type="DOI">10.1007/978-3-642-23963-2</identifier><identifier type="ISBN">978-3-642-23962-5</identifier><identifier type="eISBN">978-3-642-23963-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">273167</identifier><identifier type="BookID">978-3-642-23963-2</identifier><identifier type="BookChapterCount">43</identifier><identifier type="BookVolumeNumber">6929</identifier><identifier type="BookSequenceNumber">6929</identifier><identifier type="PartChapterCount">8</identifier><part><date>2011</date><detail type="part"><title>Argumentation Systems</title></detail><detail type="volume"><number>6929</number><caption>vol.</caption></detail><extent unit="pages"><start>149</start><end>162</end></extent></part><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Randy</namePart><namePart type="family">Goebel</namePart><affiliation>University of Alberta, Edmonton, Canada</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Wolfgang</namePart><namePart type="family">Wahlster</namePart><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Salem</namePart><namePart type="family">Benferhat</namePart><affiliation>CRIL-CNRS, University of Artois, 62307, France</affiliation><affiliation>E-mail: benferhat@cril.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="family">Grant</namePart><affiliation>Department of Mathematics, Towson University, 21252, Towson, MD, USA</affiliation><affiliation>E-mail: jgrant@towson.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Sub-Series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">13AA74D1B6AC3D9695D2373D87C730D3739F5990</identifier><identifier type="DOI">10.1007/978-3-642-23963-2_13</identifier><identifier type="ChapterID">Chap13</identifier><identifier type="ChapterID">13</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag GmbH Berlin Heidelberg</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/13AA74D1B6AC3D9695D2373D87C730D3739F5990/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">Towards ACL semantics based on commitments and penalties</title><author><persName><forename type="first">L</forename><surname>Amgoud</surname></persName></author><author><persName><surname>Dupin De Saint</surname></persName></author><author><persName><forename type="first">F</forename><surname>Cyr</surname></persName></author></analytic><monogr><title level="m">European Conf. on Artif. Intelligence (ECAI)</title><meeting><address><addrLine>Amsterdam</addrLine></address></meeting><imprint><publisher>IOS Press</publisher><date type="published" when="2006"></date><biblScope unit="page" from="235" to="239"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">Strategical considerations for argumentative agents (preliminary report)</title><author><persName><forename type="first">L</forename><surname>Amgoud</surname></persName></author><author><persName><forename type="first">N</forename><surname>Maudet</surname></persName></author></analytic><monogr><title level="m">Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR) Special session on Argument</title><meeting>the 9th International Workshop on Non-Monotonic Reasoning (NMR) Special session on Argument</meeting><imprint><date type="published" when="2002"></date><biblScope unit="page" from="409" to="417"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b2"><analytic><title level="a" type="main">Modelling dialogues using argumentation</title><author><persName><forename type="first">L</forename><surname>Amgoud</surname></persName></author><author><persName><forename type="first">N</forename><surname>Maudet</surname></persName></author><author><persName><forename type="first">S</forename><surname>Parsons</surname></persName></author></analytic><monogr><title level="m">Proc. of the International Conference on Multi-Agent Systems</title><meeting>. of the International Conference on Multi-Agent Systems<address><addrLine>Boston, MA</addrLine></address></meeting><imprint><date type="published" when="2000"></date><biblScope unit="page" from="31" to="38"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b3"><monogr><title level="m" type="main">How to Do Things With Words</title><author><persName><forename type="first">J</forename><surname>Austin</surname></persName></author><imprint><date type="published" when="1962"></date><publisher>Harvard University Press</publisher><pubPlace>Cambridge (Mass ; Paperback</pubPlace></imprint></monogr><note>2nd. edn</note></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Persuasion in practical argument using value-based argumentation frameworks</title><author><persName><forename type="first">T</forename><surname>Bench-Capon</surname></persName></author></analytic><monogr><title level="j">J. of Logic and Computation</title><imprint><biblScope unit="volume">13</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="429" to="448"></biblScope><date type="published" when="2003"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">A logic-based theory of deductive arguments</title><author><persName><forename type="first">P</forename><surname>Besnard</surname></persName></author><author><persName><forename type="first">A</forename><surname>Hunter</surname></persName></author></analytic><monogr><title level="j">Artificial Intelligence</title><imprint><biblScope unit="volume">1281</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="203" to="235"></biblScope><date type="published" when="2001"></date></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Using enthymemes in an inquiry dialogue system</title><author><persName><forename type="first">E</forename><surname>Black</surname></persName></author><author><persName><forename type="first">A</forename><surname>Hunter</surname></persName></author></analytic><monogr><title level="m">Proc of the 7th Int. Conf. on Autonomous Agents and Multiag. Syst</title><meeting>of the 7th Int. Conf. on Autonomous Agents and Multiag. Syst</meeting><imprint><date type="published" when="2008"></date><biblScope unit="page" from="437" to="444"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">Two party immediate response disputes: Properties and efficiency</title><author><persName><forename type="first">P</forename><surname>Dunne</surname></persName></author><author><persName><forename type="first">T</forename><surname>Bench-Capon</surname></persName></author></analytic><monogr><title level="j">Artificial Intelligence</title><imprint><biblScope unit="volume">149</biblScope><biblScope unit="page" from="221" to="250"></biblScope><date type="published" when="2003"></date></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">A first attempt to allow enthymemes in persuasion dialogs</title><author><persName><forename type="first">F</forename><surname>Dupin De Saint-Cyr</surname></persName></author></analytic><monogr><title level="m">DEXA International Workshop: Data, Logic and Inconsistency</title><meeting><address><addrLine>DALI</addrLine></address></meeting><imprint><date type="published" when="2011"></date></imprint></monogr></biblStruct><biblStruct xml:id="b9"><analytic><title level="a" type="main">A Logical Framework for Grounding-based Dialogue Analysis</title><author><persName><forename type="first">B</forename><surname>Gaudou</surname></persName></author><author><persName><forename type="first">A</forename><surname>Herzig</surname></persName></author><author><persName><forename type="first">D</forename><surname>Longin</surname></persName></author></analytic><monogr><title level="j">Electronic Notes in Theoretical Computer Science</title><imprint><biblScope unit="volume">157</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="117" to="137"></biblScope><date type="published" when="2006"></date></imprint></monogr></biblStruct><biblStruct xml:id="b10"><analytic><title level="a" type="main">The pleadings game</title><author><persName><forename type="first">T</forename><surname>Gordon</surname></persName></author></analytic><monogr><title level="j">Artificial Intelligence and Law</title><imprint><biblScope unit="volume">2</biblScope><biblScope unit="page" from="239" to="292"></biblScope><date type="published" when="1993"></date></imprint></monogr></biblStruct><biblStruct xml:id="b11"><analytic><title level="a" type="main">Fallacies</title><author><persName><forename type="first">C</forename><surname>Hamblin</surname></persName></author></analytic><monogr><title level="j">Methuen</title><imprint><date type="published" when="1970"></date></imprint></monogr></biblStruct><biblStruct xml:id="b12"><analytic><title level="a" type="main">Real arguments are approximate arguments</title><author><persName><forename type="first">A</forename><surname>Hunter</surname></persName></author></analytic><monogr><title level="m">Proceedings of the 22nd AAAI Conference on Artificial Intelligence</title><meeting>the 22nd AAAI Conference on Artificial Intelligence<address><addrLine>Cambridge</addrLine></address></meeting><imprint><publisher>MIT Press</publisher><date type="published" when="2007"></date><biblScope unit="page" from="66" to="71"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b13"><analytic><title level="a" type="main">Enthymemes, argumentation schemes, and topics</title><author><persName><forename type="first">F</forename><surname>Macagno</surname></persName></author><author><persName><forename type="first">D</forename><surname>Walton</surname></persName></author></analytic><monogr><title level="j">Logique et Analyse</title><imprint><biblScope unit="volume">205</biblScope><biblScope unit="page" from="39" to="56"></biblScope><date type="published" when="2009"></date></imprint></monogr></biblStruct><biblStruct xml:id="b14"><analytic><title level="a" type="main">No more charity, please! enthymematic parsimony and the pitfall of benevolence</title><author><persName><forename type="first">F</forename><surname>Paglieri</surname></persName></author></analytic><monogr><title level="m">Dissensus and the search for common ground: Proc. of OSSA</title><imprint><date type="published" when="2007"></date><biblScope unit="page" from="1" to="26"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b15"><analytic><title level="a" type="main">Enthymematic parsimony</title><author><persName><forename type="first">F</forename><surname>Paglieri</surname></persName></author><author><persName><forename type="first">J</forename><surname>Woods</surname></persName></author></analytic><monogr><title level="j">Synthese</title><imprint><biblScope unit="volume">178</biblScope><biblScope unit="page" from="461" to="501"></biblScope><date type="published" when="2011"></date></imprint></monogr></biblStruct><biblStruct xml:id="b16"><analytic><title level="a" type="main">Games that agents play: A formal framework for dialogues between autonomous agents</title><author><persName><forename type="first">S</forename><surname>Parsons</surname></persName></author><author><persName><forename type="first">P</forename><surname>Mcburney</surname></persName></author></analytic><monogr><title level="j">J. of Logic, Language and Information</title><imprint><biblScope unit="volume">11</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="315" to="334"></biblScope><date type="published" when="2002"></date></imprint></monogr></biblStruct><biblStruct xml:id="b17"><monogr><title level="m" type="main">A dynamic argumentation framework</title><author><persName><forename type="first">N</forename><surname>Rotstein</surname></persName></author><author><persName><forename type="first">M</forename><surname>Moguillansky</surname></persName></author><author><persName><forename type="first">A</forename><surname>García</surname></persName></author><author><persName><forename type="first">G</forename><surname>Simari</surname></persName></author><imprint><date type="published" when="2010"></date><biblScope unit="page" from="427" to="438"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b18"><analytic><title level="a" type="main">The Art of Always Being Right: 38 Ways to Win an Argument</title><author><persName><forename type="first">A</forename><surname>Schopenhauer</surname></persName></author></analytic><monogr><title level="j">Orig. title: Die Kunst</title><imprint><date type="published" when="1831"></date></imprint></monogr><note>Recht. zu behalten (Transl. by T. Saunders in 1896</note></biblStruct><biblStruct xml:id="b19"><monogr><title level="m" type="main">Speech acts: An essay in the philosophy of language</title><author><persName><forename type="first">J</forename><surname>Searle</surname></persName></author><imprint><date type="published" when="1969"></date><publisher>Cambridge U. Press</publisher><pubPlace>Cambridge</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b20"><analytic><title level="a" type="main">A general game description language for incomplete information games</title><author><persName><forename type="first">M</forename><surname>Thielscher</surname></persName></author></analytic><monogr><title level="m">Proceedings of AAAI</title><meeting>AAAI</meeting><imprint><date type="published" when="2010"></date><biblScope unit="page" from="994" to="999"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b21"><analytic><title level="a" type="main">Using collaborations for distributed argumentation with defeasible logic programming</title><author><persName><forename type="first">M</forename><surname>Thimm</surname></persName></author><author><persName><forename type="first">A</forename><surname>Garcia</surname></persName></author><author><persName><forename type="first">G</forename><surname>Kern-Isberner</surname></persName></author><author><persName><forename type="first">G</forename><surname>Simari</surname></persName></author></analytic><monogr><title level="m">Proceedings of the 12th Int. Workshop on Non-Monotonic Reasoning</title><meeting>the 12th Int. Workshop on Non-Monotonic Reasoning</meeting><imprint><date type="published" when="2008"></date><biblScope unit="page" from="179" to="188"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b22"><analytic><title level="a" type="main">The three bases for the enthymeme: A dialogical theory</title><author><persName><forename type="first">D</forename><surname>Walton</surname></persName></author></analytic><monogr><title level="j">Journal of Applied Logic</title><imprint><biblScope unit="volume">6</biblScope><biblScope unit="page" from="361" to="379"></biblScope><date type="published" when="2008"></date></imprint></monogr></biblStruct><biblStruct xml:id="b23"><monogr><title level="m" type="main">Commitment in Dialogue: Basic Concepts of Interpersonal Reasoning</title><author><persName><forename type="first">D</forename><surname>Walton</surname></persName></author><author><persName><forename type="first">E</forename><surname>Krabbe</surname></persName></author><imprint><date type="published" when="1995"></date><publisher>State University of New York Press</publisher><pubPlace>Albany</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b24"><analytic><title level="a" type="main">Argumentation schemes and enthymemes</title><author><persName><forename type="first">D</forename><surname>Walton</surname></persName></author><author><persName><forename type="first">C</forename><surname>Reed</surname></persName></author></analytic><monogr><title level="j">Synthese</title><imprint><biblScope unit="volume">145</biblScope><biblScope unit="page" from="339" to="370"></biblScope><date type="published" when="2005"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001C56 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001C56 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:13AA74D1B6AC3D9695D2373D87C730D3739F5990
|texte= Handling Enthymemes in Time-Limited Persuasion Dialogs
}}
| This area was generated with Dilib version V0.6.21. |  |