457,438 Hits in 5.7 sec

A Note on Rich Incomplete Argumentation Frameworks [article]

Jean-Guy Mailly
2020 arXiv   pre-print
But another kind of uncertainty was introduced in the context of Control Argumentation Frameworks (CAFs): it consists in a conflict relation with uncertain orientation, i.e. we are sure that there is an  ...  attack between two arguments, but the actual direction of the attack is unknown.  ...  For NSA, the reasoning described in [4] still holds: checking the necessary skeptical acceptance of an argument can be represented by a universal quantification over the set of completions and the set  ... 
arXiv:2009.04869v3 fatcat:763l34fffvhovei3lnc6omwmb4

Argumentation and graph properties

Mamadou Bilo Doumbouya, Bernard Kamsu-Foguem, Hugues Kenfack
2016 Information Processing & Management  
In this argumentation framework, the semantics of acceptance plays a fundamental role in the argument evaluation process.  ...  The principle of this method is to combine mathematical properties (e.g. symmetry, asymmetry, strong connectivity and irreflexivity) of graphs built from the argumentation system to compute sets of accepted  ...  Data: Graph of attacks G, all arguments of the set S Result: Return a set of arguments that are credulously accepted under the admissible and preferred semantics /* The method isStronglyConnected() checks  ... 
doi:10.1016/j.ipm.2015.08.003 fatcat:27r4sriko5arpoq2ggdg223bgq

Argumentation-based Intention Formation Process

Mariela Morveli Espinoza, Ayslan Possebom, Josep Puyol-Gruart, César Augusto Tacla
2019 Dyna  
We use argumentation to support the transition of the goals from their initial state until the last one.  ...  We use argumentation to support the transition of the goals from their initial state until the last one.  ...  Using argumentation during the intention formation process gives it flexibility since the results of the argumentation can vary under new updated beliefs, which leads to change the state of a goal either  ... 
doi:10.15446/dyna.v86n208.66597 fatcat:qk66plyvxrgutm47h5hbphdnra

A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics [chapter]

Teresa Alsinet, Ramón Béjar, Lluís Godo
2010 Lecture Notes in Computer Science  
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic.  ...  The warrant recursive semantics is based on a general notion of collective (non-binary) conflict among arguments allowing to ensure direct and indirect consistency properties.  ...  Acknowledgments Authors are thankful to the anonymous reviewers for their helpful comments.  ... 
doi:10.1007/978-3-642-16952-6_5 fatcat:oij5odwffzbjdpc2i6jqynyevy

Using argumentation to model and deploy agent-based applications

Jamal Bentahar, Rafiul Alam, Zakaria Maamar, Nanjangud C. Narendra
2010 Knowledge-Based Systems  
As conflicts are bound to arise among the independent applications/agents, the framework uses a formal model based on computational argumentation theory through a persuasion protocol to detect and resolve  ...  Agents can then jointly find arguments that support a new solution for their conflicts, which is not known by any of them individually.  ...  Acknowledgements The first author is partially supported by Natural Sciences and Engineering Research Council of Canada (NSERC), Fonds québécois de la recherche sur la nature et les technologies (NATEQ  ... 
doi:10.1016/j.knosys.2010.01.005 fatcat:27z5kgquqrakvayfpy3qdzcrky

From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning [chapter]

Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2017 Lecture Notes in Computer Science  
We study the applicability of abstract argumentation (AF) reasoners in efficiently answering acceptability queries over assumption-based argumentation (ABA) frameworks, one of the prevalent forms of structured  ...  We empirically show that the approach is complementary with a state-of-the-art ABA reasoning system.  ...  In our approach, existence of stable assumption sets can be checked with an AF reasoner.  ... 
doi:10.1007/978-3-319-61581-3_6 fatcat:i34d3m4jfjdefe6phxspbw5bse

Argumentation in the View of Modal Logic [chapter]

Davide Grossi
2011 Lecture Notes in Computer Science  
The present paper applies well-investigated modal logics to provide formal foundations to specific fragments of argumentation theory.  ...  (calculi, model-checking games, bisimulation games); third, to import results (completeness of axiomatizations, complexity of model-checking, adequacy of games) from modal logic to argumentation theory  ...  This study has been funded under the NWO VENI grant 639.021.816. The author wishes to thank Sanjay Modgil for the inspiring conversation that sparked this study.  ... 
doi:10.1007/978-3-642-21940-5_12 fatcat:6cg2jhhl7zcrbil2kizo7un5my

Complexity Results for Argumentation-based Agent Communication

Jamal Bentahar, Zakaria Maamar
2007 2007 Innovations in Information Technologies (IIT)  
In this paper; we address the computational complexity problem of such conversations where agents are equipped with reasoning capabilities based upon argumentation.  ...  We argue that the computational efficiency of these conversations depends on the underlying logical language and on the type of reasoning mechanisms.  ...  In this context, a strategy is defined as a function Str mapping a set of possible arguments to an argument (the best one). Let A be the set of all arguments.  ... 
doi:10.1109/iit.2007.4430428 fatcat:vpynzgxdtfd7hotjx54frso7uy

The Epistemological Theory of Argument--How and Why?

Christoph Lumer
2005 Informal Logic  
The article outlines a general epistemological theory of argument: a theory that regards providingjustified belief as the principal aim of argumentation, and defends it instrumentalistically.  ...  After introducing some central terms of such a theory (2), answers to its central questions are proposed: the primary object and structure of the theory (3), the function of arguments, which is to lead  ...  the single check-ups of the thesis' conditions of acceptability.  ... 
doi:10.22329/il.v25i3.1135 fatcat:zigdp3pkt5eelmnji5c5ldzvvq

Structural constraints for dynamic operators in abstract argumentation

Johannes P. Wallner
2019 Argument & Computation  
An ADF is a tuple D = (A, L, C) where A is a set of arguments, L ⊆ A × A is a set of links, and C = {ϕ a } aA is a collection of acceptance conditions, each given by a formula over the parents of an argument  ...  Let A be a finite set of arguments (statements). An interpretation is a function I mapping arguments to one of the three truth values I : A → {t, f, u}.  ...  Acknowledgements We thank the anonymous reviewers of the preliminary conference version [101] and this version of the paper and Thomas Linsbichler for their useful comments.  ... 
doi:10.3233/aac-190471 fatcat:onyuqrzn6zaynnxupq2izsdaey

Modeling and Verification of a Multi-Agent Argumentation System using NuSMV [article]

Supriya D'Souza, Abhishek Rao, Amit Sharma, Sanjay Singh
2012 arXiv   pre-print
In this paper we model and verify a multi-agent argumentation scenario of resource sharing mechanism to enable resource sharing in a distributed system.  ...  Interest-based negotiation (IBN) is a form of negotiation in which agents exchange information about their underlying goals, with a view to improve the likelihood and quality of a offer.  ...  The focus is usually on underlying semantics of arguments and argument acceptability.  ... 
arXiv:1209.4330v1 fatcat:nhrpxccaxrhzjorutpy3s7r6xu

Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL [chapter]

Alexander Schimpf, Stephan Merz, Jan-Georg Smaus
2009 Lecture Notes in Computer Science  
We present the implementation in Isabelle/HOL of a translation of LTL formulae into Büchi automata.  ...  An LTL formula is represented by a (generalised) Büchi automaton that accepts precisely those behaviours allowed by the formula.  ...  -Q is a finite set of states; -I ⊆ Q is the set of initial states; δ ⊆ Q × Q is the transition relation; -F ⊆ 2 Q is the set of acceptance sets (the acceptance family).  ... 
doi:10.1007/978-3-642-03359-9_29 fatcat:jnt7kijqiffuxnte2xnmksviq4

A semantics for lazy assertions

Olaf Chitil
2011 Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation - PERM '11  
The simple reason is that each of the two assertions only sees a partial value and both (True,⊥) and (⊥,False) have to be accepted by a lazy assertion as they are approximations of the functionalisation  ...  The starting point is our formalisation of basic properties such as laziness, taking them as axioms of our design space.  ...  From a we obtain the acceptance set [[a]]: DEFINITION 1 (Acceptance set of an assertion). Let a be an assertion. Then [[a]] := {v ∈ D | a v = v} is the acceptance set of a.  ... 
doi:10.1145/1929501.1929527 dblp:conf/pepm/Chitil11 fatcat:wl6o2i4ehbgudji34vdqclcufq

A logic of argumentation for specification and verification of abstract argumentation frameworks

Serena Villata, Guido Boella, Dov M. Gabbay, Leendert van der Torre, Joris Hulstijn
2012 Annals of Mathematics and Artificial Intelligence  
For example, given a political requirement like "if the argument to increase taxes is accepted, then the argument to increase services must be accepted too," we can either verify an extension of acceptable  ...  We introduce the logic of argumentation verification to specify such requirements, and we represent the three verification problems of argumentation as model checking and theorem proving properties of  ...  Assume a set of requirements of the kind "if acceptable(a 1 ), . . . , ¬acceptable(a n ) then acceptable(b )/¬acceptable(b )", and an argumentation framework AF.  ... 
doi:10.1007/s10472-012-9318-6 fatcat:se57gpz6dfgvlmkvuwljsbtmma

Model-Based Synthesis of Incremental and Correct Estimators for Discrete Event Systems

Stéphanie Roussel, Xavier Pucel, Valentin Bouziat, Louise Travé-Massuyès
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
This avoids the ambiguity of a high number of candidate estimates and allows the decision system to be fed with a clear input.  ...  Run-time requirements advocate for incremental estimation and memory limitations lead us to consider an estimation strategy that retains only one state out of the set of candidate estimates at each time  ...  Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  ... 
doi:10.24963/ijcai.2020/257 dblp:conf/ijcai/NiskanenNJ20 fatcat:7rvcu76j3fhblclqxchztoqzty
« Previous Showing results 1 — 15 out of 457,438 results