Efficient Computation of Argumentation Semantics
Auteur : Liao Beishui
Efficient 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 in intelligent systems. Its scope includes theoretical studies, design methods, and real-world implementations and applications. The series publishes titles in three core sub-topic areas: intelligent automation, intelligent transportation systems, and intelligent computing.
- Argumentation semantics and their computation: An introduction
- Preliminaries
- Computing the semantics of dynamic argumentation systems: A division based approach
- Computing the semantics of static argumentation systems: A partition based approach
- Computing the partial semantics of argumentation: A localized approach
- Conclusions and future work
References
Electrical and Electronic Engineers; Mechanical Engineers; Computer Engineers; Intelligent Systems specialists.
- The first book to cover new methods for computing static, dynamic, and partial argumentation systems
- Methods are applicable to development of systems and research areas in both AI and broader intelligent systems
- Provides the AI and IS community with insight into the critical field of efficient computation, with a focus on intelligent automation, intelligent transportation systems, and intelligent computing
Date de parution : 01-2014
Ouvrage de 148 p.
19x23.3 cm
Thème d’Efficient Computation of Argumentation Semantics :
Mots-clés :
abstract argumentation frameworks; answer set programming; argumentation; argumentation semantics; artificial intelligence; computational complexity; conditioned sub-frameworks; decomposition; devision-based menthod; direct apporach; directionality of argumentation; divide and conquer paradigm; dynamics of argumentation; efficient algorithms; extensions; global semantics; incompleteness; inconsistency; induced sub-graphs; justification status; labelling-based algorithms; labelling-based computation; labellings; local computation; local dynamics; local semantics; local tractability; mappings; non-monotonic formalisms; partially assigned sub-frameworks; partially labelled sub-frameworks; reduction approach; semantics combination; semantics computation; semantics of argumentation; status of arguments; strongly connected components; uncertainty; unconditioned sub-frameworks