scholarly journals Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation

2013 ◽  
pp. 119-137 ◽  
Author(s):  
Pierpaolo Dondio
Keyword(s):  
Empirical Evaluation ◽  
Argumentation Framework ◽  
Grounded Semantics

scholarly journals Dynamics of Argumentation Systems: A Basic Theory

10.29007/njsm ◽  
2018 ◽  
Author(s):  
Beishui Liao ◽  
Li Jin ◽  
Rober Koons
Keyword(s):  
General Theory ◽  
Intrinsic Property ◽  
Basic Theory ◽  
Argumentation Framework ◽  
The Status ◽  
Grounded Semantics ◽  
Argumentation Systems

The changing of arguments and their attack relation is an intrinsic property of a variety of argumentation systems. So, it is very important to efficiently figure out how the status of arguments in a system evolves when the system is updated. However, unlike other areas of argumentation that have been deeply explored, such as argumentation semantics, proof theories, and algorithms, etc., dynamics of argumentation systems has been comparatively neglected. In this paper, we introduce a general theory (called a division-based method) to cope with this problem based on a new concept: the division of an argumentation framework. When an argumentation framework is updated, it is divided into three parts: an unaffected, an affected, and a conditioning part. The status of arguments in the unaffected sub-framework remains unchanged, while the status of the affected arguments is computed in a special argumentation framework (called a conditioned argumentation framework, or briefly CAF) that is composed of an affected part and a conditioning part. We have proved that under a certain semantics that satisfies the directionality criterion (complete, preferred, ideal, or grounded semantics), the extensions of the updated framework are equal to the result of a combination of the extensions of an unaffected sub-framework and sets of the extensions of a set of assigned CAFs. The theory shows that the complexity of computing the dynamics of argumentation will decrease to a lesser or greater extent, depending on the types of argumentation semantics, the topologies of argumentation frameworks, and the number of affected arguments with respect to an addition or a deletion. As a result, this theory is expected to be very useful in various kinds of argumentation systems where arguments and attacks are dynamics, due to the changing of underlying knowledge and information.

scholarly journals Reasoning with Inconsistent Possibilistic Ontologies by Applying Argument Accrual

2017 ◽  
Vol 17 (02) ◽  
pp. e16
Author(s):  
Sergio Alejandro Gómez
Keyword(s):  
Logic Programming ◽  
Description Logic ◽  
Logic Programs ◽  
Argumentation Framework ◽  
Abstract Argumentation ◽  
Possibilistic Logic ◽  
Grounded Semantics

We present an approach for performing instance checking in possibilistic description logic programming ontologies by accruing arguments that support the membership of individuals to concepts. Ontologies are interpreted as possibilistic logic programs where accruals of arguments as regarded as vertexes in an abstract argumentation framework. A suitable attack relation between accruals is defined. We present a reasoning framework with a case study and a Java-based implementation for enacting the proposed approach that is capable of reasoning under Dung’s grounded semantics.

No false grounds and topology of argumentation

2020 ◽  
Author(s):  
Chenwei Shi
Keyword(s):  
Formal Analysis ◽  
Logical Structure ◽  
Axiom System ◽  
Point Of View ◽  
Gettier Problem ◽  
Argumentation Framework ◽  
Justified Belief ◽  
And Topology ◽  
Grounded Semantics ◽  
The Gettier Problem

Abstract We integrate Dung’s argumentation framework with a topological space to formalize Clark’s no false lemmas theory for solving the Gettier problem and study its logic. Our formalization shows that one of the two notions of knowledge proposed by Clark, justified belief with true grounds, satisfies Stalnaker’s axiom system of belief and knowledge except for the axiom of closure under conjunction. We propose a new notion of knowledge, justified belief with a well-founded chain of true grounds, which further improves on Clark’s two notions of knowledge. We pinpoint a seemingly reasonable condition which makes these three notions of knowledge collapse into the same one and explain why this result looks counter-intuitive. From a technical point of view, our formal analysis driven by the philosophical issues reveals the logical structure of the grounded semantics in Dung’s argumentation theory.

Semi-empirical evaluation of Sr-Ar difference potentials

1986 ◽  
Vol 47 (7) ◽  
pp. 1149-1154
Author(s):  
Le Quang Rang ◽  
D. Voslamber
Keyword(s):  
Empirical Evaluation ◽  
Difference Potentials ◽  
Semi Empirical

Computationally Augmented Retrosynthesis: Total Synthesis of Paspaline A and Emindole PB

2018 ◽  
Author(s):  
Timothy Newhouse ◽  
Daria E. Kim ◽  
Joshua E. Zweig
Keyword(s):  
Chemical Synthesis ◽  
Total Synthesis ◽  
Small Molecules ◽  
First Principles ◽  
Quantum Chemical ◽  
Computational Analysis ◽  
Empirical Evaluation ◽  
Synthetic Strategy ◽  
Catalyzed Reactions ◽  
Enzyme Catalyzed Reactions

The diverse molecular architectures of terpene natural products are assembled by exquisite enzyme-catalyzed reactions. Successful recapitulation of these transformations using chemical synthesis is hard to predict from first principles and therefore challenging to execute. A means of evaluating the feasibility of such chemical reactions would greatly enable the development of concise syntheses of complex small molecules. Herein, we report the computational analysis of the energetic favorability of a key bio-inspired transformation, which we use to inform our synthetic strategy. This approach was applied to synthesize two constituents of the historically challenging indole diterpenoid class, resulting in a concise route to (–)-paspaline A in 9 steps from commercially available materials and the first pathway to and structural confirmation of emindole PB in 13 steps. This work highlights how traditional retrosynthetic design can be augmented with quantum chemical calculations to reveal energetically feasible synthetic disconnections, minimizing time-consuming and expensive empirical evaluation.

Sign in / Sign up

Export Citation Format

Share Document