![]() Baroni, Pietro ![]() ![]() in Proceedings of COMMA (2012) This paper introduces Input/Output Argumentation Frameworks, a novel approach to characterize the behavior of an argumentation framework as a sort of black box exposing a well-defined external interface ... [more ▼] This paper introduces Input/Output Argumentation Frameworks, a novel approach to characterize the behavior of an argumentation framework as a sort of black box exposing a well-defined external interface. As a starting point, we define the novel notion of semantics decomposability and analyze complete, stable, grounded and preferred semantics in this respect. Then we show as a main result that, under grounded, complete, stable and credulous preferred semantics, Input/Output Argumentation Frameworks with the same behavior can be interchanged without affecting the result of semantics evaluation of other arguments interacting with them [less ▲] Detailed reference viewed: 58 (3 UL)![]() Boella, Guido ![]() ![]() ![]() in Proceedings of the 13th International Workshop on Coordination, Organization, Institutions and Norms (COIN@WI-IAT) (2011) Satisficing, the concept proposed by Herbert Simon, as an approach to reaching agreements is little explored. We propose a model for satisficing agreement reaching for an adaptive collaborative group of ... [more ▼] Satisficing, the concept proposed by Herbert Simon, as an approach to reaching agreements is little explored. We propose a model for satisficing agreement reaching for an adaptive collaborative group of agents. The group consists of one human agent familiar with the problem and arbitrarily many artificial agents. Our model raises to the team level the recognition-primed decision model constructed in the field of cognitive decision-making by using social choice for reaching group opinions. [less ▲] Detailed reference viewed: 117 (0 UL)![]() Aucher, Guillaume ![]() ![]() in DBSec (2011) In this paper we first introduce a logic for describing formally a family of delegation and revocation models that are based on the work in Hagström et al.. We then extend our logic to accommodate an ... [more ▼] In this paper we first introduce a logic for describing formally a family of delegation and revocation models that are based on the work in Hagström et al.. We then extend our logic to accommodate an epistemic interpretation of trust within the framework that we define. What emerges from this work is a rich framework of formally well-defined delegation and revocation schemes that accommodates an important trust component. [less ▲] Detailed reference viewed: 130 (1 UL)![]() Boella, Guido ![]() ![]() ![]() in Bibliothèque(s) : revue de l'Association des bibliothécaires de France (2010) We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in ... [more ▼] We introduce and study higher-order coalition logic, a multi modal monadic second-order logic with operators [{x}ψ]φ expressing that the coalition of all agents satisfying ψ(x) can achieve a state in which φ holds. We use neighborhood semantics to model extensive games of perfect information with simultaneous actions and we provide a framework reasoning about agents in the same way as it is reasoning about their abilities. We illustrate higher-order coalition logic to represent and reason about coalition formation and cooperation, we show a more general and expressive way to quantify over coalitions than quantified coalition logic, we give an axiomatization and prove completeness. [less ▲] Detailed reference viewed: 60 (0 UL)![]() Boella, Guido ![]() ![]() in Proceedings of the 4th Mahasarakham International Workshop on Artificial Intelligence (MIWAI'10) (2010) Detailed reference viewed: 62 (0 UL)![]() ; Boella, Guido ![]() ![]() in Proceedings of the 11th Symposium on Artificial Intelligence of the Italian Association for Artificial Intelligence (AIIA'10) (2010) Trust in multiagent systems is used for seeking to minimize the uncertainty in the interactions among the agents. In this paper, we discuss how to use argumentation to reason about trust. Using the ... [more ▼] Trust in multiagent systems is used for seeking to minimize the uncertainty in the interactions among the agents. In this paper, we discuss how to use argumentation to reason about trust. Using the methodology of meta-argumentation, first we represent the source of the information from which the argument is constructed in the abstract argumentation framework capturing the fact that b is attacked because b is from a particular source s. We show how a source of information can be attacked if it is not evaluated as trustworthy. Second, we provide a fine grained representation of the trust relationships between the information sources in which trust concerns not only the sources but also the single arguments and attack relations the sources propose. Moreover, we represent the evidences in support of the arguments which are put forward by the information sources and the agents can express arguments by referring to other agents’ arguments. Meta-argumentation allows us not to extend Dung’s abstract argumentation framework by introducing trust and to reuse those principles and properties defined for Dung’s framework. [less ▲] Detailed reference viewed: 55 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Proceedings of the 11th International Workshop on Coordination, Optimization, Institution and Norms in Multiagent Systems (COIN@MALLOW'10) (2010) An agent intends g if it has chosen to pursue goal g an is committed to pursuing g . How do groups decide on a common goal? Social epistemology offers two views on collective attitudes: according to the ... [more ▼] An agent intends g if it has chosen to pursue goal g an is committed to pursuing g . How do groups decide on a common goal? Social epistemology offers two views on collective attitudes: according to the summative approach, a group has attitude p if all or most of the group members have the attitude p; according to the non-summative approach, for a group to have attitude p it is required that the members together agree that they have attitude p. The summative approach is used extensively in multi-agent systems. We propose a formalization of non-summative group intentions, using social choice to determine the group goals. We use judgment aggregation as a decision-making mechanism and a multi-modal multi-agent logic to represent the collective attitudes, as well as the commitment and revision strategies for the groups intentions. [less ▲] Detailed reference viewed: 73 (1 UL)![]() Boella, Guido ![]() ![]() ![]() in Proceedings of the Third International Conference on Computational Models of Argument (COMMA'10) (2010) n this paper, we consider two drawbacks of Cayrol and Lagasque-Schiex's meta-argumentation theory to model bipolar argumentation frameworks. We consider first the “lost of admissibility” in Dung's sense ... [more ▼] n this paper, we consider two drawbacks of Cayrol and Lagasque-Schiex's meta-argumentation theory to model bipolar argumentation frameworks. We consider first the “lost of admissibility” in Dung's sense and second, the definition of notions of attack in the context of a support relation. We show how to prevent these drawbacks by introducing support meta-arguments. Like the model of Cayrol and Lagasque-Schiex, our formalization confirms the use of meta-argumentation to reuse Dung's properties. We do not take a stance towards the usefulness of a support relation among arguments, though we show that if one would like to introduce them, it can be done without extending Dung's theory. Finally, we show how to use meta-argumentation to instantiate an argumentation framework to represent defeasible support. In this model of support, the support relation itself can be attacked. [less ▲] Detailed reference viewed: 231 (1 UL)![]() Boella, Guido ![]() in KR 2010 (2010) If compliance with a norm does not achieve its purpose, then its applicability must dynamically be restricted or expanded. Legal interpretation is a mechanism from law allowing norms to be adapted to ... [more ▼] If compliance with a norm does not achieve its purpose, then its applicability must dynamically be restricted or expanded. Legal interpretation is a mechanism from law allowing norms to be adapted to unforeseen situations. We model this mechanism for norms regulating computer systems by representing the purpose of norms by social goals and by revising the constitutive rules defining the applicability of norms. We illustrate the interpretation mechanism by examples. [less ▲] Detailed reference viewed: 120 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Proceedings of JURIX 2009 - The 22nd International Conference on Legal Knowledge and Information Systems (2009, December) n this paper we introduce and discuss five guidelines for the use of normative systems in computer science. We adopt a multiagent systems perspective, because norms are used to coordinate, organize, guide ... [more ▼] n this paper we introduce and discuss five guidelines for the use of normative systems in computer science. We adopt a multiagent systems perspective, because norms are used to coordinate, organize, guide, regulate or control interaction among distributed autonomous systems. They are derived from the computer science literature. From the so-called ‘normchange’ definition of the first workshop on normative multiagent systems in 2005 we derive the guidelines to motivate which definition of normative multiagent system is used, to make explicit why norms are a kind of (soft) constraints deserving special analysis, and to explain why and how norms can be changed at runtime. From the so-called ‘mechanism design’ definition of the second workshop on normative multiagent systems in 2007 we derive the guidelines to discuss the use and role of norms as a mechanism in a game-theoretic setting, and to clarify the role of norms in the multiagent system. [less ▲] Detailed reference viewed: 105 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Logic Journal of the IGPL (2009), 17(3), 273297 We introduce a reciprocity criterion for coalition formation among goal-directed agents, which we call the indecomposable do-ut-des property. It refines an older reciprocity property, called the do-ut-des ... [more ▼] We introduce a reciprocity criterion for coalition formation among goal-directed agents, which we call the indecomposable do-ut-des property. It refines an older reciprocity property, called the do-ut-des or give-to-get property by considering the fact that agents prefer to form coalitions whose components cannot be formed independently. A formal description of this property is provided as well as an analysis of algorithms and their complexity. We provide an algorithm to decide whether a coalition has the desired property, and we show that the problem to verify whether a single coalition satisfies the property is tractable. Moreover, we provide an algorithm to search all the sub-coalitions of a given coalition satisfying the new property. Even if this problem is not computationally tractable, we show that in several cases, also the complexity of this problem may decrease considerably. [less ▲] Detailed reference viewed: 113 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Knowledge & Information Systems (2009), 18(2), 137156 In this paper, we introduce an agent communication protocol and speech acts for norm negotiation. The protocol creates individual or contractual obligations to fulfill goals of the agents based on the so ... [more ▼] In this paper, we introduce an agent communication protocol and speech acts for norm negotiation. The protocol creates individual or contractual obligations to fulfill goals of the agents based on the so-called social delegation cycle. First, agents communicate their individual goals and powers. Second, they propose social goals which can be accepted or rejected by other agents. Third, they propose obligations and sanctions to achieve the social goal, which can again be accepted or rejected. Finally, the agents accept the new norm by indicating which of their communicated individual goals the norm achieves. The semantics of the speech acts is based on a commitment to public mental attitudes. The norm negotiation model is illustrated by an example of norm negotiation in multi-player online gaming. [less ▲] Detailed reference viewed: 168 (3 UL)![]() Boella, Guido ![]() ![]() ![]() in Logic Journal of the IGPL (2009) In this paper we consider the relation between beliefs and goals in agent theory. Beliefs play three roles in reasoning about goals: they play a role in the generation of unconditional desires from ... [more ▼] In this paper we consider the relation between beliefs and goals in agent theory. Beliefs play three roles in reasoning about goals: they play a role in the generation of unconditional desires from conditional ones, they play a role in adoption of desires as goals, and they play a role in the selection of plans to achieve goals. In this paper we consider the role of goals in reasoning about beliefs. Though we assume that goals do not play a role in the belief generation problem, we argue that they play a role in the belief selection problem. We show the rationality of the use of goals in belief selection, in the sense that there are cases in which agents that take their goals into account in selecting a belief set from a set of alternatives outperform agents that do not do so. We also formally distinguish between the rational role of goals in belief selection and irrational wishful thinking. [less ▲] Detailed reference viewed: 139 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 10th European Conference, ECSQARU 2009, Verona, Italy, July 1-3, 2009. Proceedings (2009) In this paper we consider the dynamics of abstract argumentation in Baroni and Giacomin’s framework for the evaluation of extension based argumentation semantics. Following Baroni and Giacomin, we do not ... [more ▼] In this paper we consider the dynamics of abstract argumentation in Baroni and Giacomin’s framework for the evaluation of extension based argumentation semantics. Following Baroni and Giacomin, we do not consider individual approaches, but we define general principles or postulates that individual approaches may satisfy. In particular, we define abstraction principles for the attack relation, and for the arguments in the framework. We illustrate the principles on the grounded extension. In this paper we consider only principles for the single extension case, and leave the multiple extension case to further research. [less ▲] Detailed reference viewed: 123 (0 UL)![]() Boella, Guido ![]() ![]() in Journal of Universal Computer Science (2009), 15(13), We introduce an approach to iteratively design `small' social networks used in software engineering together with methods analyzing the cooperation in the system. The degree of cooperation is measured by ... [more ▼] We introduce an approach to iteratively design `small' social networks used in software engineering together with methods analyzing the cooperation in the system. The degree of cooperation is measured by the emergence of coalitions and their stability over time. At the most abstract level, which we call the coalition view, coalitions are abstract entities that may dominate or attack other coalitions. During iterative design, these abstract entities are refined with agents and their dependencies constituting the coalitions (dependence view), the powers of sets of agents to see to goals (power view) and finally the beliefs, plans, tasks and goals of agents (agent view). The analysis methods predict the emergence of coalitions based on reciprocity and argumentation theory. [less ▲] Detailed reference viewed: 52 (1 UL)![]() Boella, Guido ![]() ![]() ![]() in BNAIC 2009: 21th Belgian - Netherlands Conference on Artificial Intelligence (2009) In this paper we first formalize dependence networks that can be automaticaly build to model goalbased relationships among agents. Then, we propose three algorithms to build and check the consistency of a ... [more ▼] In this paper we first formalize dependence networks that can be automaticaly build to model goalbased relationships among agents. Then, we propose three algorithms to build and check the consistency of a dependence network. We start presenting the elements composing our ontology such as agents, goals, skills, dependencies with the addition of the institutional notions of roles, institutional goals, institutional skills. We investigate the reasons behind the possible inconsistencies in building the combined dependence network and we propose an algorithm to check them [less ▲] Detailed reference viewed: 61 (5 UL)![]() Boella, Guido ![]() ![]() ![]() in Normative framework for normative system change (2009) Normative systems in a multiagent system must be able to evolve over time, for example due to actions creating or removing norms in the system. The only formal framework to evaluate and classify normative ... [more ▼] Normative systems in a multiagent system must be able to evolve over time, for example due to actions creating or removing norms in the system. The only formal framework to evaluate and classify normative system change methods is the so-called AGM framework of theory change, which has originally been developed as a framework to describe and classify both belief and normative system change. However, it has been used for belief change only, since the beliefs or norms are represented as propositional formulas. We therefore propose, as a normative framework for normative system change, to replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of norms, and to add several principles from the input/output logic framework. In this new framework, we show that some of the AGM properties cannot be expressed, and other properties are consistent only for some logics, but not for others. [less ▲] Detailed reference viewed: 219 (0 UL)![]() Boella, Guido ![]() ![]() in Proceedings of IAT 2009: Procs. of IEEE/WIC/ACM International Conference on Intelligent Agent Technology (2009) In this paper we introduce a theory of meta-argumentation, by using Dung’s theory of abstract argumentation to reason about itself. Meta-arguments are generated from atomic arguments, and extensions of ... [more ▼] In this paper we introduce a theory of meta-argumentation, by using Dung’s theory of abstract argumentation to reason about itself. Meta-arguments are generated from atomic arguments, and extensions of acceptable meta-arguments are based on Dung’s argumentation semantics. To illustrate our theory, we show how to represent Toulmin schemes in this theory by introducing meta-arguments using the Caminada labeling, and meta-arguments for support [less ▲] Detailed reference viewed: 105 (1 UL)![]() Baldoni, Matteo ![]() ![]() ![]() in Proceedings of PROMAS (2009) Organizations and roles are often seen as mental constructs, good to be used during the design phase in Multi Agent Systems, but they have also been considered as first class citizens in MAS, when ... [more ▼] Organizations and roles are often seen as mental constructs, good to be used during the design phase in Multi Agent Systems, but they have also been considered as first class citizens in MAS, when objective coordination is needed. Roles facilitate the coordination of agents inside an organization, and they give new abilities in the context of organizations, called powers, to the agents which satisfy the necessary requirements to play them. No general purpose programming languages for multiagent systems offer primitives to program organizations and roles as instances existing at runtime, so, in this paper, we propose our extension of the Jade framework, with Java primitives to program organizations structured in roles, and to enable agents to play roles in organizations. We provide classes and protocols which enable an agent to enact a new role in an organization, to interact with the role by invoking the execution of powers, and to receive new goals to be fulfilled. Roles and organizations can be on a different platform with respect to the role players, and communication is protocol-based. Since they can have complex behaviours, they are implemented by extending the Jade agent class. Our aim is to give to programmers a middle tier, built on the Jade platform, useful to solve with minimal implementative effort many coordination problems, and to offer a first, implicit, management of norms and sanctions. [less ▲] Detailed reference viewed: 125 (0 UL)![]() Boella, Guido ![]() ![]() ![]() in Normative Multi-agent Systems (2009) In this paper we introduce and discuss ten guidelines for the use of normative systems in computer science. We adopt a multiagent sys- tems perspective, because norms are used to coordinate, organize ... [more ▼] In this paper we introduce and discuss ten guidelines for the use of normative systems in computer science. We adopt a multiagent sys- tems perspective, because norms are used to coordinate, organize, guide, regulate or control interaction among distributed autonomous systems. The first six guidelines are derived from the computer science literature. From the so-called ‘normchange’ definition of the first workshop on nor- mative multiagent systems in 2005 we derive the guidelines to motivate which definition of normative multiagent system is used, to make explicit why norms are a kind of (soft) constraints deserving special analysis, and to explain why and how norms can be changed at runtime. From the so-called ‘mechanism design’ definition of the second workshop on nor- mative multiagent systems in 2007 we derive the guidelines to discuss the use and role of norms as a mechanism in a game-theoretic setting, clarify the role of norms in the multiagent system, and to relate the no- tion of “norm” to the legal, social, or moral literature. The remaining four guidelines follow from the philosophical literature: use norms also to resolve dilemmas, and in general to coordinate, organize, guide, regulate or control interaction among agents, distinguish norms from obligations, prohibitions and permissions, use the deontic paradoxes only to illustrate the normative multiagent system, and consider regulative norms in rela- tion to other kinds of norms and other social-cognitive computer science concepts. [less ▲] Detailed reference viewed: 191 (2 UL) |
||