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

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 199-230

In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung’s abstract argumentation frameworks. We distinguish three kinds of decision ... [more ▼]

In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung’s abstract argumentation frameworks. We distinguish three kinds of decision problems for argumentation verification, called extension verification, framework verification, and specification verification respectively. 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 arguments, or all extensions of an argumentation framework, or all extensions of all argumentation frameworks satisfying a framework specification. 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 the logic. Moreover, we recast the logic of argumentation verification in a modal framework, in order to express multiple extensions, and properties like transitivity and reflexivity of the attack relation. Finally, we introduce a logic of meta-argumentation where abstract argumentation is used to reason about abstract argumentation itself. We define the logic of meta-argumentation using the fibring methodology in such a way to represent attack relations not only among arguments but also among attacks. [less ▲]

Agent Programming Languages Requirements for Programming Cognitive Robots (extended abstract)

Scientific Conference (2012)

This paper presents various requirements for BDI-based agent programming languages to provide better support for implementing autonomous robotic control systems. Examples of such requirements are: 1 ... [more ▼]

This paper presents various requirements for BDI-based agent programming languages to provide better support for implementing autonomous robotic control systems. Examples of such requirements are: 1- Built-in support for integration with existing robotic frameworks such as ROS, 2- Real-time reactivity to events, 3- Management of heterogeneous sensory data and reasoning on complex events, and 4- Representation of complex plans and coordination of the parallel execution of plans. [less ▲]

Normative Multi-Agent Systems

in Dagstuhl Reports (2012), 2(3), 23-49

Normative systems are systems in the behavior of which norms play a role and which need normative concepts in order to be described or specified. A normative multi-agent system combines models for ... [more ▼]

Normative systems are systems in the behavior of which norms play a role and which need normative concepts in order to be described or specified. A normative multi-agent system combines models for normative systems (dealing for example with obligations, permissions and prohibitions) with models for multi-agent systems. Norms have been proposed in multi-agent systems and computer science to deal with issues of coordination, security, electronic commerce and institutions, agent organization. However, due to the lack of a unified theory, many multi-agent system researchers are presently developing their own ad hoc concepts and applications. The aim of this Dagstuhl Seminar was to formulate a collective appraisal of the current perspectives in the field and the most promising venues for future activity. In particular, the seminar has been conceived for the writing of a volume titled "A Prospective view of Normative Multi Agent Systems" aimed to become a standard reference in the field and to provide guidelines for future research in normative multi-agent systems. [less ▲]

Modelling defeasible and prioritized support in bipolar argumentation

in Annals of Mathematics & Artificial Intelligence (2012), 66(1-4), 163-197

Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is ... [more ▼]

Cayrol and Lagasquie-Schiex introduce bipolar argumentation frameworks by introducing a second relation on the arguments for representing the support among them. The main drawback of their approach is that they cannot encode defeasible support, for instance they cannot model an attack towards a support relation. In this paper, we introduce a way to model defeasible support in bipolar argumentation frameworks. We use the methodology of meta-argumentation in which Dung’s theory is used to reason about itself. Dung’s well-known admissibility semantics can be used on this meta-argumentation framework to compute the acceptable arguments, and all properties of Dung’s classical theory are preserved. Moreover, we show how different contexts can lead to the alternative strengthening of the support relation over the attack relation, and converse. Finally, we present two applications of our methodology for modeling support, the case of arguments provided with an internal structure and the case of abstract dialectical frameworks. [less ▲]

Reasoning for Agreement Technologies

in ECAI 2012 (2012)

We present a logical viewpoint on agreement technologies by combining reasoning methods for aggregation, norms, dependence, argumentation, and trust. Starting from the agreement technologies tower, we ... [more ▼]

We present a logical viewpoint on agreement technologies by combining reasoning methods for aggregation, norms, dependence, argumentation, and trust. Starting from the agreement technologies tower, we introduce an architecture for the agreement process with interacting reasoning processes. We discuss the input/output perspective on reasoning for agreement technologies, the combination of reasoning methods, the role of abstraction, and game theoretic foundations. [less ▲]

Multi-sorted Argumentation

in Proceedings of the 1st International Workshop on the Theory and Applications of Formal Argumentation (TAFA 2011) (2011, July 16), 7132

In the theory of abstract argumentation, the acceptance status of arguments is normally determined for the complete set of arguments at once, under a single semantics. However, this is not always desired ... [more ▼]

In the theory of abstract argumentation, the acceptance status of arguments is normally determined for the complete set of arguments at once, under a single semantics. However, this is not always desired. In this paper, we extend the notion of an argumentation framework to a multi-sorted argumentation framework, and we motivate this extension using an example which considers practical and epistemic arguments. In a multi-sorted argumentation framework, the arguments are partitioned into a number of cells, where each cell is associated with a semantics under which its arguments are evaluated. We prove the properties of the proposed framework, and we demonstrate our theory with a number of examples. Finally, we relate our theory to the theory of modal fibring of argumentation networks. [less ▲]

Neural Symbolic Architecture for Normative Agents

in In Proceedings of The Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011). May, 2011 (2011)

In this paper we propose a neural-symbolic architecture to represent and reason with norms in multi-agent systems. On the one hand, the architecture contains a symbolic knowledge base to represent norms ... [more ▼]

In this paper we propose a neural-symbolic architecture to represent and reason with norms in multi-agent systems. On the one hand, the architecture contains a symbolic knowledge base to represent norms and on the other hand it contains a neural network to reason with norms. The interaction between the symbolic knowledge and the neural network is used to learn norms. We describe how to handle normative reasoning issues like contrary to duties, dilemmas and exceptions by using a priority-based ordering between the norms in a neural-symbolic architecture. [less ▲]

Selected and revised papers from the Ninth International Conference on Deontic Logic in Computer Science (DEON 2008)

in Journal of Applied Logic (2011), 9(2), 8182

A Satisficing Agreements Model

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 ▲]

Arguing about the Trustworthiness of the Information Sources

in ECSQARU (2011)

Trust minimizes the uncertainty in the interactions among the information sources. To express the possibly conflicting motivations about trust and distrust, we reason about trust using argumentation ... [more ▼]

Trust minimizes the uncertainty in the interactions among the information sources. To express the possibly conflicting motivations about trust and distrust, we reason about trust using argumentation theory. First, we show how to model the sources and how to attack untrustworthy sources. Second, we provide a focused representation of trust about the sources in which trust concerns not only the sources but also the information items and the relation with other information. [less ▲]