Paraconsistent semantics of speech acts

Dunin-Keplicz, Barbara; Strachocka, Alina; Szałas, Andrzej; Verbrugge, Rineke

doi:10.1016/j.neucom.2014.10.001

Cited by 11 publications

(6 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the ontology may be huge, the inconsistency affects only literals involving ns(.). Some Further Use-Cases Due to a limited space let us only indicate some further use cases being directly relevant to the current paper: 3 actions in potentially inconsistent/incomplete environments [14]; belief fusion and shadowing [13,22]; argumentation [23,24]; approximate reasoning [59].…”

Section: Selected Use-casesmentioning

confidence: 99%

See 1 more Smart Citation

A Paraconsistent ASP-like Language with Tractable Model Generation

Szalas

2019

Preprint

View full text Add to dashboard Cite

Answer Set Programming (ASP) is nowadays a dominant rule-based knowledge representation tool. Though existing ASP variants enjoy efficient implementations, generating an answer set remains intractable. The goal of this research is to define a new ASP-like rule language, 4SP, with tractable model generation. The language combines ideas of ASP and a paraconsistent rule language 4QL. Though 4SP shares the syntax of ASP and for each program all its answer sets are among 4SP models, the new language differs from ASP in its logical foundations, the intended methodology of its use and complexity of computing models. As we show in the paper, 4QL can be seen as a paraconsistent counterpart of ASP programs stratified with respect to default negation. Although model generation of well-supported models for 4QL programs is tractable, dropping stratification makes both 4QL and ASP intractable. To retain tractability while allowing non-stratified programs, in 4SP we introduce trial expressions interlacing programs with hypotheses as to the truth values of default negations. This allows us to develop a model generation algorithm with deterministic polynomial time complexity. We also show relationships among 4SP, ASP and 4QL.

show abstract

Section: Selected Use-casesmentioning

confidence: 99%

“…E.g., if the goal is important, like helping victims, a plan with inconsistent goal may be better than having no plan. For many further arguments towards paraconsistency see [1,3,10,11,12,13,14,20,17,24,57,61] and numerous references there.…”

Section: Introduction and Motivationsmentioning

confidence: 99%

A Paraconsistent ASP-like Language with Tractable Model Generation

Szalas

2019

Preprint

View full text Add to dashboard Cite

show abstract

“…question ψ, if ϕ is a conjunction and ψ is one of its operands, 4. why ϕ, if ϕ is a disjunction, 5. attack or defence of any formula uttered before, if P is the player, 6. no move, if (a) claim ϕ is an attack on negation and ϕ is a proposition, (b) claim ϕ is a defence executed by P, and O has attacked this defence before;…”

Section: P1mentioning

confidence: 99%

“…This work provides a schema of deliberation dialogue along with semantics of adequate speech acts. An implementation of speech acts in a paraconsistent framework is shown in [4]. In this approach, a natural four-valued model of interaction is based on 4QL formalism [13].…”

Section: Introductionmentioning

confidence: 99%

Proving Propositional Tautologies in a Natural Dialogue

Yaskorska

Budzyńska

Kacprzak

2013

Fundamenta Informaticae

View full text Add to dashboard Cite

The paper proposes a dialogue system LND which brings together and unifies two traditions in studying dialogue as a game: the dialogical logic introduced by Lorenzen; and persuasion dialogue games as specified by Prakken. The first approach allows the representation of formal dialogues in which the validity of argument is the topic discussed. The second tradition has focused on natural dialogues examining, e.g., informal fallacies typical in real-life communication. Our goal is to unite these two approaches in order to allow communicating agents to benefit from the advantages of both, i.e., to equip them with the ability not only to persuade each other about facts, but also to prove that a formula used in an argument is a classical propositional tautology. To this end, we propose a new description of the dialogical logic which meets the requirements of Prakken's generic specification for natural dialogues, and we introduce rules allowing to embed a formal dialogue in a natural one. We also show the correspondence result between the original and the new version of the dialogical logic, i.e., we show that a winning strategy for a proponent in the original version of the dialogical logic means a winning strategy for a proponent in the new version, and conversely.

show abstract

“…The issue of logical modelling of communication in AI, especially in teamwork, is studied in (Dunin-Kȩplicz and Verbrugge 2010). An implementation of speech acts in a paraconsistent framework is shown in (Dunin-Kȩplicz et al 2012). In AI, specification of speech acts is closely related to dynamical character of systems in which dialogues are performed.…”

mentioning

confidence: 99%

Dialogue Protocols for Formal Fallacies

Kacprzak

Yaskorska

2014

Argumentation

View full text Add to dashboard Cite

This paper presents a dialogue system called Lorenzen-Hamblin Natural Dialogue (LHND), in which participants can commit formal fallacies and have a method of both identifying and withdrawing formal fallacies. It therefore provides a tool for the dialectical evaluation of force of argument when players advance reasons which are deductively incorrect. The system is inspired by Hamblin's formal dialectic and Lorenzen's dialogical logic. It offers uniform protocols for Hamblin's and Lorenzen's dialogues and adds a protocol for embedding them. This unification required a reformulation of the original description of Lorenzen's system to distinguish ''between different stances that a person might take in the discussion'', as suggested by Hodges. The LHND system is compared to Walton and Krabbe's Complex Persuasion Dialogue using an example of a dialogue.

show abstract

Paraconsistent semantics of speech acts

Cited by 11 publications

References 32 publications

A Paraconsistent ASP-like Language with Tractable Model Generation

A Paraconsistent ASP-like Language with Tractable Model Generation

Proving Propositional Tautologies in a Natural Dialogue

Dialogue Protocols for Formal Fallacies

Contact Info

Product

Resources

About