The Equational Approach to CF2 Semantics

03/01/2012
by   Dov M. Gabbay, et al.
0

We introduce a family of new equational semantics for argumentation networks which can handle odd and even loops in a uniform manner. We offer one version of equational semantics which is equivalent to CF2 semantics, and a better version which gives the same results as traditional Dung semantics for even loops but can still handle odd loops.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2002

Well-Founded Argumentation Semantics for Extended Logic Programming

This paper defines an argumentation semantics for extended logic program...
research
01/20/2021

One-way resynchronizability of word transducers

The origin semantics for transducers was proposed in 2014, and led to va...
research
04/26/2021

Relational Argumentation Semantics

In this paper, we propose a fresh perspective on argumentation semantics...
research
12/19/2020

On graded semantics of abstract argumentation: Extension-based case

Based on Grossi and Modgil's recent work [1], this paper considers some ...
research
03/30/2022

Continuous Integration of Data Histories into Consistent Namespaces

We describe a policy-based approach to the scaling of shared data servic...
research
03/19/2021

Weakly Complete Semantics Based on Undecidedness Blocking

In this paper we introduce a novel family of semantics called weakly com...
research
02/18/2002

Distance Semantics for Belief Revision

A vast and interesting family of natural semantics for belief revision i...

Please sign up or login with your details

Forgot password? Click here to reset