An argumentation theoretic semantics based on non-refutable falsity

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

We contend that the well-founded semantics (WFS), for normal program, and similarly the well-founded semantics with explicit negation (WFSX), for extended ones are, by design, overly careful in deciding about the falsity of some atoms, by leaving them undefined. We’ve dealt with this issue in normal programs and have previously defined the O-semantics, one that extends WFS by addjoining to it more negative assumptions, at the expense of undefined literals. The goal of this paper is to generalize that work to extended programs, and define a semantics for such programs that enlarges WFSX with more negative assumptions. To achieve this we view default literals as arguments a rational agent can sustain along with the program. As our goal is to enlarge WFSX, we consider the latter as the common reasoning ground and argumentation tool of agents. With this basis, and in order to define the semantics, we first formalize the concepts of consistent and non-refutable sets of arguments (or of hypotheses). In general several such sets may exist. So, and in order to define a unique semantics, given by a single set of additional assumptions, we introduce an additional non-refutability of arguments criterium - tenability - for always and finally preferring just one set of arguments over another.

Original languageEnglish
Title of host publicationNon-Monotonic Extensions of Logic Programming - ICLP 1994 Workshop, Selected Papers
EditorsJürgen Dix, Teodor C. Przymusinski, Louis Moniz Pereira
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages3-22
Number of pages20
ISBN (Electronic)978-3-540-49272-6
ISBN (Print)3540594671, 978-3-540-59467-3
DOIs
Publication statusPublished - 1995
EventWorkshop on Non-Monotonic Extensions of Logic Programming, ICLP 1994 - Santa Margherita Ligure, Italy
Duration: 17 Jun 199417 Jun 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Volume927
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceWorkshop on Non-Monotonic Extensions of Logic Programming, ICLP 1994
Country/TerritoryItaly
CitySanta Margherita Ligure
Period17/06/9417/06/94

Fingerprint

Dive into the research topics of 'An argumentation theoretic semantics based on non-refutable falsity'. Together they form a unique fingerprint.

Cite this