000 | 05802cam a2200685Mi 4500 | ||
---|---|---|---|
001 | u380112 | ||
003 | SIRSI | ||
005 | 20160812084631.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 140104s2014 enk ob 001 0 eng d | ||
040 |
_aEBLCP _beng _epn _cEBLCP _dOPELS _dNT _dUMI _dUIU _dYDXCP _dB24X7 _dCOO _dOCLCO _dDEBBG _dDEBSZ _dOCLCO _dOCLCQ _dOCLCO _dOCLCF |
||
019 | _a870677102 | ||
020 |
_a9780124104068 _q(electronic bk.) |
||
020 |
_a0124104061 _q(electronic bk.) |
||
020 |
_a9780124104518 _q(electronic bk.) |
||
020 |
_a0124104517 _q(electronic bk.) |
||
029 | 1 |
_aAU@ _b000053308407 |
|
029 | 1 |
_aDEBSZ _b404338402 |
|
029 | 1 |
_aDEBSZ _b405353006 |
|
029 | 1 |
_aCHVBK _b327777168 |
|
029 | 1 |
_aCHBIS _b010295140 |
|
029 | 1 |
_aNLGGC _b373105649 |
|
050 | 4 |
_aP98 _b.E384 2014 |
|
082 | 0 | 4 | _a006.3/5 |
049 | _aTEFA | ||
100 | 1 | _aLiao, Beishui. | |
245 | 1 | 0 |
_aEfficient computation of argumentation semantics _h[recurso electrónico] / _cBeishui Liao. |
260 |
_aOxford : _bAcademic Press, _c2014. |
||
300 | _a1 online resource (149 pages). | ||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
490 | 1 | _aIntelligent systems series | |
588 | 0 | _aPrint version record. | |
505 | 0 | _aHalf Title; Editorial Page; Title Page; Copyright; Contents; Preface; 1 Introduction; 1.1 Background; 1.2 The Notion of Argumentation; 1.3 Motivations of this Book; 1.4 The Structure of this Book; References; 2 Semantics of Argumentation; 2.1 Introduction; 2.2 Abstract Argumentation Frameworks; 2.3 Argumentation Semantics; 2.3.1 Extension-based Approach; 2.3.1.1 Admissible Extension; 2.3.1.2 Complete Extension; 2.3.1.3 Grounded Extension and Preferred Extension; 2.3.1.4 Stable Extension and Semi-Stable Extension; 2.3.1.5 Ideal Extension and Eager Extension; 2.3.2 Labelling-based Approach. | |
505 | 8 | _a2.3.2.1 Admissible Labelling2.3.2.2 Complete Labelling; 2.3.2.3 Grounded Labelling and Preferred Labelling; 2.3.2.4 Stable Labelling and Semi-Stable Labelling; 2.3.2.5 Ideal Labelling and Eager Labelling; 2.3.3 Relations Between the Two Approaches; 2.3.4 Relations Between Different Semantics; 2.3.5 Status of Arguments; 2.4 Conclusions; References; 3 Existing Approaches for Computing Argumentation Semantics; 3.1 Introduction; 3.2 Approaches Based on Answer Set Programming; 3.2.1 Answer Set Programming; 3.2.1.1 Syntax; 3.2.1.2 Answer Set Semantics; 3.2.2 ASP for Argumentation. | |
505 | 8 | _a3.3 Labelling-Based Algorithms3.3.1 The Computation of Grounded Labellings; 3.3.2 The Computation of Preferred Labellings; 3.3.2.1 Generating Admissible Labellings; 3.3.2.2 Generating Preferred Labellings; 3.4 Conclusions; References; 4 Sub-Frameworks and Local Semantics; 4.1 Introduction; 4.2 Notion of Sub-Frameworks; 4.2.1 Informal Idea; 4.2.2 Formal Definition; 4.2.3 Dependence Relation Between Different Sub-Frameworks; 4.3 Semantics of Sub-Frameworks; 4.3.1 Labellings of a Conditioned Sub-Framework; 4.3.2 Extensions of a Conditioned Sub-Framework. | |
505 | 8 | _a4.4 Computation of the Semantics of a Sub-Framework4.5 Conclusions; References; 5 Relations between Global Semantics and Local Semantics; 5.1 Introduction; 5.2 Mapping Global Semantics to Local Semantics; 5.3 Mapping Local Semantics to Global Semantics; 5.3.1 Combining Extensions of Two Unconditioned Sub-Frameworks; 5.3.2 Combining Extensions of a Conditioned Sub-Framework and Those of an Unconditioned Sub-Framework; 5.3.3 Combining Labellings of Two Conditioned Sub-Frameworks; 5.4 Conclusions; References; 6 An Approach for Static Argumentation Frameworks; 6.1 Introduction. | |
505 | 8 | _a6.2 Decomposing an Argumentation Framework: A Layered Approach6.2.1 Strongly Connected Components of an Argumentation Framework; 6.2.2 A Decomposition Approach Based on SCCs; 6.3 An Incremental Approach to Compute Argumentation Semantics; 6.3.1 The Computation of Layer i (); 6.3.1.1 Constructing Partially Labelled Sub-Frameworks in Layer i (); 6.3.1.2 Computing the Labellings of Each Sub-Framework in Layer i (); 6.3.1.3 Horizontally Combining the Labellings of Layer i (); 6.3.1.4 Vertically Combining the Labellings of Layers from 0 to i (). | |
500 | _aIncludes index. | ||
520 | _aEfficient Computation of Argumentation Semantics addresses argumentation semantics and systems, introducing readers to cutting-edge decomposition methods that drive increasingly efficient logic computation in AI and intelligent systems. Such complex and distributed systems are increasingly used in the automation and transportation systems field, and particularly autonomous systems, as well as more generic intelligent computation research. The Series in Intelligent Systems publishes titles that cover state-of-the-art knowledge and the latest advances in research and development. | ||
504 | _aIncludes bibliographical references and index. | ||
650 | 0 | _aSemantic computing. | |
650 | 0 | _aArtificial intelligence. | |
650 | 4 | _aArtificial intelligence. | |
650 | 4 | _aSemantic computing. | |
650 | 4 | _aSemantics. | |
650 | 7 |
_aCOMPUTERS _xGeneral. _2bisacsh |
|
650 | 7 |
_aArtificial intelligence. _2fast _0(OCoLC)fst00817247 |
|
650 | 7 |
_aSemantic computing. _2fast _0(OCoLC)fst01748947 |
|
655 | 4 | _aElectronic books. | |
776 | 0 | 8 |
_iPrint version: _aLiao, Beishui. _tEfficient Computation of Argumentation Semantics. _dBurlington : Elsevier Science, 2014 _z9780124104068 |
830 | 0 | _aIntelligent systems series. | |
856 | 4 | 0 |
_zLibro electrónico _3ScienceDirect _uhttp://148.231.10.114:2048/login?url=http://www.sciencedirect.com/science/book/9780124104068 |
596 | _a19 | ||
942 | _cLIBRO_ELEC | ||
999 |
_c207033 _d207033 |