Published on Thu May 14 2020

On abstract F-systems. A graph-theoretic model for paradoxes involving a falsity predicate and its application to argumentation frameworks

Gustavo A. Bodanza

F-systems are digraphs that enable to model sentences that predicate the falsity of other sentences. The existence of conglomerate guarantees the absence of paradoxes. Conglomerates also enable to characterize referential contradictions.

0
0
0
Abstract

F-systems are digraphs that enable to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and Yablo's can be analyzed with that tool to find graph-theoretic patterns. In this paper we present the F-systems model abstracting from all the features of the language in which the represented sentences are expressed. All that is assumed is the existence of sentences and the binary relation '... affirms the falsity of ...' among them. The possible existence of non-referential sentences is also considered. To model the sets of all the sentences that can jointly be valued as true we introduce the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enable to characterize referential contradictions, i.e. sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke's style fixed point characterization of groundedness is offered and fixed points which are complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) are put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of F-systems. We show the relation between local conglomerates and admissible sets of arguments and argue about the usefulness of the concept for argumentation theory.

Wed Jul 10 2002
Artificial Intelligence
Well-Founded Argumentation Semantics for Extended Logic Programming
0
0
0
Mon Nov 04 2019
Artificial Intelligence
Compiling Arguments in an Argumentation Framework into Three-valued Logical Expressions
A general allocator is an abstraction of all complete labelings for an argumentation framework. Any complete labeling is obtained from a general allocators by assigning logical constants to variables. The method, including local allocation, is applicable to broad extensions of frameworks.
0
0
0
Mon Feb 05 2018
Artificial Intelligence
Abstractly Interpreting Argumentation Frameworks for Sharpening Extensions
Cycles of attacking arguments pose non-trivial issues in Dung style argumentation theory. We consider argument graphs together with a certain lattice like semantic structure over arguments e.g. ontology. As we show, the semantic-argumentgraphic hybrid theory allows
0
0
0
Thu Sep 25 2014
Artificial Intelligence
Causal Graph Justifications of Logic Programs
In this work we propose a multi-valued extension of logic programs. Each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs formed by rule labels.
0
0
0
Thu May 09 2019
Artificial Intelligence
Extensions to Justification Theory
Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts. In this extended abstract, we lay out possible extensions to justification theory.
0
0
0
Thu Jun 11 2009
Artificial Intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. It includes the general case of nested logic programs, where arbitrary Boolean combinations are permitted in heads and bodies of rules.
0
0
0