Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Metabolic Pathways as Temporal Logic Programs Kapitel lesen Erstes Kapitel lesen

2016 | OriginalPaper | Buchkapitel

Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

verfasst von : Sergio Greco, Francesco Parisi

Erschienen in: Logics in Artificial Intelligence

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We address the problem of efficiently recomputing the extensions of abstract argumentation frameworks (AFs) which are updated by adding/deleting arguments or attacks. In particular, after identifying some properties that hold for updates of AFs under several well-known semantics, we focus on the two most popular ‘deterministic’ semantics (namely, grounded and ideal) and present two algorithms for their incremental computation, well-suited to dynamic applications where updates to an initial AF are frequently performed to take into account new available knowledge. We experimentally validated the proposed approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Standard Sequent Calculi for Lewis’ Logics of Counterfactuals
Nächstes Kapitel Revising Possibilistic Knowledge Bases via Compatibility Degrees
Literatur
1.
2.
Baroni, P., Boella, G., Cerutti, F., Giacomin, M., van der Torre, L.W.N., Villata, S.: On the input/output behavior of argumentation frameworks. Artif. Intell. 217, 144–197 (2014)MathSciNetCrossRefMATH
3.
Baroni, P., Caminada, M., Giacomin, M.: An introduction to argumentation semantics. Knowl. Eng. Rev. 26(4), 365–410 (2011)CrossRef
4.
Baroni, P., Giacomin, M., Liao, B.: On topology-related properties of abstract argumentation semantics. a correction and extension to dynamics of argumentation systems: A division-based method. Artif. Intell. 212, 104–115 (2014)MathSciNetCrossRefMATH
5.
Baumann, R.: Splitting an argumentation framework. In: Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 40–53 (2011)
6.
7.
Baumann, R.: Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation. In: Proceedings of ECAI, pp. 63–68 (2014)
8.
Baumann, R., Brewka, G.: Expanding argumentation frameworks: enforcing and monotonicity results. In: Proceedings of COMMA, pp. 75–86 (2010)
9.
Baumann, R., Brewka, G., Dvorák, W., Woltran, S.: Parameterized splitting: a simple modification-based approach. In: Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, pp. 57–71 (2012)
10.
11.
Bisquert, P., Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.: Characterizing change in abstract argumentation systems. Trends Belief Revision Argum. Dyn. 48, 75–102 (2013)MathSciNetMATH
12.
Boella, G., Kaci, S., van der Torre, L.W.N.: Dynamics in argumentation with single extensions: abstraction principles and the grounded extension. In: Proceedings of ECSQARU, pp. 107–118 (2009)
13.
Boella, G., Kaci, S., van der Torre, L.W.N.: Dynamics in argumentation with single extensions: attack refinement and the grounded extension. In: Proceedings of ArgMAS, pp. 150–159 (2009)
14.
Calautti, M., Greco, S., Trubitsyna, I.: Detecting decidable classes of finitely ground logic programs with function symbols. In: 15th International Symposium on Principles and Practice of Declarative Programming, PPDP 2013, Madrid, Spain, 16–18 September 2013, pp. 239–250 (2013)
15.
Caminada, M.: Semi-stable semantics. In: Proceedings of COMMA, pp. 121–130 (2006)
16.
Caminada, M., Sá, S., Alcântara, J., Dvorák, W.: On the equivalence between logic programming semantics and argumentation semantics. Int. J. Approx. Reason. 58, 87–111 (2015)MathSciNetCrossRefMATH
17.
Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.: Revision of an argumentation system. In: Proceedings of KR, pp. 124–134 (2008)
18.
Cayrol, C., de Saint-Cyr, F.D., Lagasquie-Schiex, M.: Change in abstract argumentation frameworks: adding an argument. J. Artif. Intell. Res. 38, 49–84 (2010)MathSciNetMATH
19.
Charwat, G., Dvorák, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation - a survey. Artif. Intell. 220, 28–63 (2015)MathSciNetCrossRefMATH
20.
Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321–358 (1995)MathSciNetCrossRefMATH
21.
22.
23.
Dunne, P.E., Bench-Capon, T.J.M.: Two party immediate response disputes: properties and efficiency. Artif. Intell. 149(2), 221–250 (2003)MathSciNetCrossRefMATH
24.
Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. In: Argumentation in Artificial Intelligence, pp. 85–104 (2009)
25.
Dvorák, W., Pichler, R., Woltran, S.: Towards fixed-parameter tractable algorithms for argumentation. In: Proceedings of KR (2010)
26.
Dvorák, W., Woltran, S.: Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11), 425–430 (2010)MathSciNetCrossRefMATH
27.
Eiter, T., Strass, H., Truszczyński, M., Woltran, S. (eds.): Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. LNCS (LNAI), vol. 9060. Springer, Heidelberg (2015)
28.
Falappa, M.A., Garcia, A.J., Kern-Isberner, G., Simari, G.R.: On the evolving relation between belief revision and argumentation. Knowl. Eng. Rev. 26(1), 35–43 (2011)CrossRef
29.
Fazzinga, B., Flesca, S., Parisi, F.: Efficiently estimating the probability of extensions in abstract argumentation. In: Proceedings of SUM, pp. 106–119 (2013)
30.
Fazzinga, B., Flesca, S., Parisi, F.: On the complexity of probabilistic abstract argumentation. In: Proceedings of IJCAI, pp. 898–904 (2013)
31.
Fazzinga, B., Flesca, S., Parisi, F.: On the complexity of probabilistic abstract argumentation frameworks. ACM Trans. Comput. Log. 16(3), 22 (2015)MathSciNetCrossRefMATH
32.
Fazzinga, B., Flesca, S., Parisi, F.: On efficiently estimating the probability of extensions in abstract argumentation frameworks. Int. J. Approx. Reason. 69, 106–132 (2016)MathSciNetCrossRefMATH
33.
Fazzinga, B., Flesca, S., Parisi, F., Pietramala, A.: PARTY: a mobile system for efficiently assessing the probability of extensions in a debate. In: Proceedings of DEXA, pp. 220–235 (2015)
34.
Greco, S., Molinaro, C., Trubitsyna, I.: Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments. TPLP 13(4–5), 737–752 (2013)MathSciNetMATH
35.
Greco, S., Molinaro, C., Trubitsyna, I., Zumpano, E.: NP datalog: a logic language for expressing search and optimization problems. TPLP 10(2), 125–166 (2010)MathSciNetMATH
36.
Greco, S., Parisi, F.: Efficient computation of deterministic extensions for dynamic abstract argumentation frameworks. In: Proceedings of ECAI, pp. 1668–1669 (2016)
37.
Liao, B.S., Jin, L., Koons, R.C.: Dynamics of argumentation systems: a division-based method. Artif. Intell. 175(11), 1790–1814 (2011)MathSciNetCrossRefMATH
38.
Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of ICLP, pp. 23–37 (1994)
39.
Modgil, S., Prakken, H.: Revisiting preferences and argumentation. In: Proceedings of IJCAI, pp. 1021–1026 (2011)
40.
Oikarinen, E., Woltran, S.: Characterizing strong equivalence for argumentation frameworks. Artif. Intell. 175(14–15), 1985–2009 (2011)MathSciNetCrossRefMATH
41.
42.
Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence. Springer, New York (2009)
43.
Thimm, M.: Tweety: a comprehensive collection of java libraries for logical aspects of artificial intelligence and knowledge representation. In: Proceedings of KR (2014)
44.
Vreeswijk, G., Prakken, H.: Credulous and sceptical argument games for preferred semantics. In: Proceedings of JELIA, pp. 239–253 (2000)
45.
Xu, Y., Cayrol, C.: The matrix approach for abstract argumentation frameworks. In: Proceedings of International TAFA Workshop, pp. 243–259 (2015)
Metadaten
Titel
Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
verfasst von
Sergio Greco
Francesco Parisi
Copyright-Jahr
2016
Buch
Logics in Artificial Intelligence

Print ISBN: 978-3-319-48757-1

Electronic ISBN: 978-3-319-48758-8

Copyright-Jahr: 2016

DOI
https://doi.org/10.1007/978-3-319-48758-8_19

Premium Partner

    Bildnachweise