Various types of everyday arguments are represented as argumentation schemes, originating from the Legal Argumentation literature. The recent achievements in this domain can be applied to multi-agent settings to enrich the paradigmatic aspects of communication and reasoning. Agents typically popula te complex environments where incompleteness and inconsistency of information is rather a rule than exception. Although the problem how to tackle inconsistencies is already present in argumentation, a paraconsistent (that is, tolerating inconsistency) approach is still missing from the literature. The contribution of this research is a computationally-friendly framework for formalizing paraconsistent argumentation schemes. This is achieved by extending agent's reasoning capabilities with non-deductive methods rooted in argumentation. To this end we provide a generic paraconsistent program template for implementation of various argumentation schemes. Our methodology is strongly influenced by ideas underlying 4QL: a four-valued, rule-based, Datalog¬¬-like query language. Thanks to its properties, the tractability of the solution (so hardly obtainable in logical modeling) has been reached. The paper concludes with examples of several paraconsistent argumentation schemes implemented in 4QL.

In the contemporary autonomous systems the role of complex interactions such as (possibly relaxed) dialogues is increasing significantly. In this paper we provide a paraconsistent and paracomplete implementation of inquiry dialogue under realistic assumptions regarding availability and quality of information. Various strategies for dealing with unsure and inconsistent information are analyzed. The corresponding dialogue outcomes are further evaluated against the (paraconsistent and paracomplete) distributed beliefs of the group.A specific 4-valued logic underpins the presented framework. Thanks to the qualities of the implementation tool: a rule-based query language 4QL, our solution is both expressive and tractable.

This paper discusses an implementation of four speech acts: assert, concede, request and challenge in a paraconsistent framework. A natural four-valued model of interaction yields multiple new cognitive situations. They are analyzed in the context of communicative relations, which partially replace the concept of trust. These assumptions naturally lead to six types of situations, which often require performing conflict resolution and belief revision.The particular choice of a rule-based, DATALOC. like query language 4QL as a four-valued implementation framework ensures that, in contrast to the standard two-valued approaches, tractability of the model is achieved. (C) 2014 Elsevier B.V. All rights reserved.

Some conflicts appearing in multi-agent settings may be resolved via communication. In this paper, besides conflicts of opinions, paradigmatically resolved by persuasion, we study resolution of conflicting justifications of opinions. To cope with agents’ ignorance and inconsistencies, often arising from perception and interactions, our formal framework Talk𝙻𝙾𝙶 employs a 4-valued logic with two additional logical values: unknown and inconsistent. Within Talk𝙻𝙾𝙶 we study such properties of persuasion as: termination, soundness and completeness. Another critical issue is complexity of agents’ communication, typically interleaved with reasoning. In Talk𝙻𝙾𝙶 tractability of both aspects is obtained thanks to the implementation tool: rule-based 4-valued language 4QL.

In an agent activity both paradigmatic aspects of communication and reasoning can be naturally enriched by argumentation. The contribution of this research is a computationally-friendly framework for formalizing paraconsistent argumentation schemes in information-rich environments. This goal is achieved by extending agent's reasoning capabilities with non-deductive methods like argumentation skills. We provide a~generic paraconsistent program template permitting for implementation of various argumentation schemes. To do this, we appeal to techniques specific for the~four-valued framework of 4ql, the~rule-based, dlognneg-like query language. Although dealing with paraconsistency in argumentation schemes is not a new subject, our computational approach takes advantage of the tractability of 4ql. The paper concludes with an example of the Expert Opinion scheme implemented in 4ql.

Building on our diverse research traditions in the study of reasoning, language and communication, the Polish School of Argumentation integrates various disciplines and institutions across Poland in which scholars are dedicated to understanding the phenomenon of the force of argument. Our primary goal is to craft a methodological programme and establish organisational infrastructure: this is the first key step in facilitating and fostering our research movement, which joins people with a common research focus, complementary skills and an enthusiasm to work together. This statement—the Manifesto—lays the foundations for the research programme of the Polish School of Argumentation.

The overall goal of this research program is a construction of a paraconsistent model of agents’ communication, comprising two building blocks: speaking about facts and speaking about reasoning rules. To construct complex dialogues, such as persuasion, deliberation, information seeking, negotiation or inquiry, the speech acts theory provides the necessary building material. This paper extends the implementation of the speech act assert in the paraconsistent framework, presented in our previous paper, by providing means for agents to perceive and learn not only facts, but also rules. To this end the admissibility criterion for a rule to be accepted has been defined and the Algorithm for Perceiving Assertions About Rules has been proposed. A natural four-valued model of interaction yields multiple new cognitive situations. Epistemic profiles encode the way agents reason, and therefore also deal with inconsistent or lacking information. Communicative relations in turn comprise various aspects of communication and allow for the fine-tuning of applications. The particular choice of a rule-based, Datalog ¬¬-like query language 4QL as a four-valued implementation framework ensures that, in contrast to the standard two-valued approaches, tractability of the model is maintained.

This paper discusses an implementation of four speech acts: assert, concede, request and challenge in a paraconsistent framework. A natural four-valued model of interaction yields multiple new cogn ...

Cooperation in multi-agent systems essentially hinges on appropriate communication. This paper shows how to model communication in teamwork within TEAMLOG, the first multi-modal framework wholly capturing a methodology for working together. Taking off from the dialogue theory of Walton and Krabbe, the paper focuses on deliberation, the main type of dialogue during team planning. We provide a fourstage schema of deliberation dialogue along with semantics of adequate speech acts, filling the gap in logical modeling of communication during planning.

Cooperation in multi-agent systems essentially hinges on appropriate communication. This paper shows how to model communication in teamwork within TeamLog, the first multi-modal framework wholly capturing a methodology for working together. Starting from the dialogue theory ofWalton and Krabbe, the paper focuses on deliberation, the main type of dialogue during team planning. We provide a schema of deliberation dialogue along with semantics of adequate speech acts, this way filling the gap in logical modeling of communication during planning.

This paper discusses an implementation of speech acts in a paraconsistent framework. We analyze four speech acts: assert, concede, request and challenge as building blocks of agents’ interactions. A natural four-valued model of interaction yields multiple new cognitive situations. They are analyzed in the context of communicative relations, which partially replace the concept of trust. These assumptions naturally lead to six types of situations: perceiving inconsistent information, perceiving previously inconsistent information, perceiving previously unknown information, perceiving unknown information, perceiving compatible information and perceiving contradictory information. These new situations often require performing conflict resolution and belief revision. The particular choice of a rule-based, DATALOG¬¬-like query language 4QL as a four-valued implementation framework ensures that, in contrast to the standard two-valued approaches, tractability of the model is maintained. The work concludes with a discussion of an example. 1 Modeling Assumptions The development of contemporary multiagent systems (MAS) demands an adequate and precise logical modeling of the environment. Recently, there is a wide choice of knowledge representation methods. Each time, these methods should be selected carefully on an application-specific basis. When confining to logic-based approaches and formalisms, traditionally two-valued logics prevail. They fail, however, to express richer modeling possibilities when some values or properties are simply not known, or when the available information is inconsistent. A natural remedy for such situations is introducing four logical values [3, 23, 27]. This work aligns with a whole line of research concerning logical modeling, reasoning and communicating about the surrounding reality, under the assumption that we deal with four types of situations, encoded in the four logical values: ? Supported by the Polish National Science Centre grant 2011/01/B/ST6/02769. 2 B. Dunin-Kȩplicz et al. – fact a holds, – fact a does not hold, – it is not known whether a holds, – information about a is inconsistent. This reflects the current informational stance of an agent, which is dynamic in nature, exhibiting the dynamism of its environment. Whenever a change occurs, a belief revision is performed to account for the alteration in question. This paper opens our research programme on paraconsistent modeling of communication in the four-valued framework. We start from a paraconsistent model of speech acts, aiming ultimately at achieving a four-valued formalization of dialogues and argumentation. If argumentation-based dialogues are considered as communicative games between two or more agents, speech acts can be viewed as their building blocks. They are used to compose complex dialogues, such as persuasion, deliberation, information seeking, negotiation or inquiry and can be seen as the underlying reactive layer of communication (see [35] for the definitions of various dialogue types, and [1,4,10,14,16,17,29,30,32] for investigations in multi-agent argumentation-based dialogue). In the process of exchanging messages, we naturally treat the sender and the receiver as two independent information sources, which try to expand, update, and revise their beliefs through communication. Usually, the level of trust between agents influences this process. We intend to disregard the heavily computational theory of trust [6, 7] in favor of three model situations, which take place in traditional communication. Instead of introducing the levels of trust between the sender and receiver, we consider three communicative relations between the two agents involved: – communication with authority, – peer to peer communication, – communication with subordinate. When deciding on what four-valued formalism to adopt, we directed out attention to 4QL [26, 27], a rule-based, paraconsistent language, due to its low complexity and unique features distinguishing it from other similar formalisms. Keeping in mind our goal: adequate modeling of human-computer interactions in time-critical systems, we are prepared to pay the price of some expressiveness limitations concerning dialogues in order to maintain those important properties of 4QL. This four-valued approach to speech acts, based on 4QL, is most likely new in the literature. The aim of this paper is to give foundations for communication in multiagent systems based on 4QL. We analyze perceiving speech acts and propose a specific conflict resolution method. A natural four-valued model of interaction yields multiple new cognitive situations. Therefore we distinguish six types of them: perceiving inconsistent information, perceiving previously inconsistent information, perceiving previously unknown information, perceiving unknown information, perceiving compatible information and perceiving contradictory information. We analyze them one by one, providing a sort of semantics of four selected speech acts: assert, concede, request and challenge. It is given in terms of triples consisting of preconditions, speech acts and A Paraconsistent Approach to Speech Acts 3 complex post actions. Along with defining rules for perceiving speech acts, we indicate their detailed impact on the receiver’s informational stance. The paper is structured as follows. First, in Section 2, we introduce speech acts theory. Section 3 is devoted to a four-valued logic which is used throughout the paper and to basic information on 4QL, a rule language suitable as an efficient implementation tool. Section 4 discusses the main technical contribution of the paper. Section 5 illustrates our ideas by an example. Finally, Section 6 concludes the paper. 2 Drawing upon Speech Acts Theory Since the early 20th century linguists and philosophers of language have been studying speech acts. Their theory originates from J.L. Austin’s book [2], where he stated an observation that some utterances cannot be verified as true or false. This led to the division of speech acts into constatives, which can be assigned a logical truth value, and the remaining group of performatives. Austin’s successor, Searle, created perhaps the most popular taxonomy, identifying: assertives, directives, commissives, expressives and declaratives [33]. The aim of an assertive act is to make a commitment to the truth of the expressed proposition. A way in which an assertive can be assessed is with respect to the truth or falsity of the asserted proposition. Some examples of assertives include: suggesting, hypothesizing, stating. Directives are aimed at getting the hearer to do something, for example: inviting, begging, pleading and challenging. A special case of directives are questions. The purpose of commissives is to commit the speaker to some future action, for example, promising or swearing. The goal of uttering an expressive act is to express a psychological state (thanking, apologizing, congratulating). The essence of a declarative is reflected in the expression “saying makes it so”. For example, by uttering “I pronounce you husband and wife”, a couple is declared to be married. Other examples of such speech acts are christening or declaring war. This theory views communication as complex actions changing the mental states of dialogue participants. Various speech acts, viewed as typical actions can be represented in dynamic logic, by characterizing their preand post-conditions. Austin defined the effects of illocutionary acts as perlocutionary acts: the effects on the attitudes and actions of the hearer. We define them in terms of the changes in agents’ beliefs and actions (see also [10, 14, 16, 17]). Speech acts have been extensively used in modeling communication in MAS to express intentions of the sender [22]. There have been many approaches to defining their semantics [1,24,29,30], some based on Belnap’s four-valued logic [25]. Still, some researchers view them as primitive notions [31]. Within the most popular mentalistic approach, reflected in languages such as KQML and FIPA ACL [22], speech acts are defined through their impact on agents’ mental attitudes. The current paper clearly falls in that approach (see especially Subsection 4.6). 4 B. Dunin-Kȩplicz et al. 3 Four-valued Framework 3.1 The Underlying Logic To model phenomena such as lack and inconsistency of information, a commonly used logic is the four-valued logic proposed in [3]. However, as discussed, e.g., in [12, 34], the approach of [3] is problematic. Namely, in areas we focus on it often provides results deviating from intuitions. Our approach is strongly influenced by ideas underlying the 4QL query language [26, 27] which does not share such problems. In what follows all sets are finite except for sets of formulas. We deal with the classical first-order language over a given vocabulary without function symbols. We assume that Const is a fixed set of constants, V ar is a fixed set of variables and Rel is a fixed set of relation symbols. A literal is an expression of the form R(τ̄) or ¬R(τ̄), with τ̄ ∈ (Const ∪ V ar), where k is the arity of R. Ground literals over Const, denoted by G(Const), are literals without variables, with all constants in Const. If ` = ¬R(τ̄) then ¬` def = R(τ̄). Though we use the classical first-order syntax, the presented semantics substantially differs from the classical one. Namely, – truth values t, i, u, f (true, inconsistent, unknown, false) are explicitly present;5 – the semantics is based on sets of ground literals rather than on relational structures. This allows one to deal with the lack of information as well as inconsistencies (indicated respectively by truth values u and i). The semantics of propositional connectives is summarized in Table 1. Observe that definitions of ∧ and ∨ reflect minimum and maximum w.r.t. the ordering