scholarly journals Two Aspects of Relevance in Structured Argumentation: Minimality and Paraconsistency

2016 ◽  
Vol 56 ◽  
pp. 197-245 ◽  
Author(s):  
Diana Grooters ◽  
Henry Prakken
Keyword(s):  
Knowledge Base ◽  
Classical Logic ◽  
Inference Rules ◽  
Proper Extension ◽  
Combined Use ◽  
Structured Argumentation

This paper studies two issues concerning relevance in structured argumentation in the context of the ASPIC+ framework, arising from the combined use of strict and defeasible inference rules. One issue arises if the strict inference rules correspond to classical logic. A longstanding problem is how the trivialising effect of the classical Ex Falso principle can be avoided while satisfying consistency and closure postulates. In this paper, this problem is solved by disallowing chaining of strict rules, resulting in a variant of the ASPIC+ framework called ASPIC*, and then disallowing the application of strict rules to inconsistent sets of formulas. Thus in effect Rescher & Manor's paraconsistent notion of weak consequence is embedded in ASPIC*. Another issue is minimality of arguments. If arguments can apply defeasible inference rules, then they cannot be required to have subset-minimal premises, since defeasible rules based on more information may well make an argument stronger. In this paper instead minimality is required of applications of strict rules throughout an argument. It is shown that under some plausible assumptions this does not affect the set of conclusions. In addition, circular arguments are in the new ASPIC* framework excluded in a way that satisfies closure and consistency postulates and that generates finitary argumentation frameworks if the knowledge base and set of defeasible rules are finite. For the latter result the exclusion of chaining of strict rules is essential. Finally, the combined results of this paper are shown to be a proper extension of classical-logic argumentation with preferences and defeasible rules.

New method for building ASP knowledge base from knowledge in classical logic

2010 ◽  
Vol 30 (11) ◽  
pp. 2932-2936
Author(s):  
Ling-zhong ZHAO ◽  
Xue-song WANG ◽  
Jun-yan QIAN ◽  
Guo-yong CAI
Keyword(s):  
Knowledge Base ◽  
Classical Logic ◽  
New Method

scholarly journals Enforcing Sets of Formulas in Structured Argumentation

2021 ◽  
Author(s):  
AnneMarie Borg ◽  
Floris Bex
Keyword(s):  
Knowledge Base ◽  
Research Topic ◽  
Important Research ◽  
Argumentation Framework ◽  
Important Research Topic ◽  
Structured Argumentation ◽  
Dynamic Argumentation

Enforcement, adjusting an argumentation framework such that a certain set of arguments becomes acceptable, is an important research topic within the study of dynamic argumentation, but one that has been little studied for structured argumentation. In this paper we study enforcement in a general structured argumentation setting. In particular, we study conditions on the argumentation setting and the knowledge base that ensure (or prevent) the acceptability of sets of formulas for structured argumentation frameworks.

scholarly journals Recovery operators, paraconsistency and duality

2019 ◽  
Vol 28 (5) ◽  
pp. 624-656 ◽  
Author(s):  
Walter Carnielli ◽  
Marcelo E Coniglio ◽  
Abilio Rodrigues
Keyword(s):  
Common Core ◽  
Classical Logic ◽  
Propositional Logic ◽  
Inference Rules ◽  
Object Language ◽  
Logical Operators ◽  
Formal Systems ◽  
Excluded Middle

Abstract There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express metalogical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the logics of formal inconsistency (LFIs) and by the logics of formal undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core—in the case studied here, this common core is classical positive propositional logic. The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of LFI and undeterminedness, namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion one at a time. The last sections offer an algebraic account for such logics by adapting the swap structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite nondeterministic matrices.

The Application of Data Fusion on Fault Diagnosis in Motor Coil

2013 ◽  
Vol 871 ◽  
pp. 342-346
Author(s):  
Jie Chen ◽  
Ke Ren Zhang ◽  
Wei Guo Zhu ◽  
Ya Wang ◽  
Jing Zhao
Keyword(s):  
Fault Diagnosis ◽  
Data Fusion ◽  
Knowledge Base ◽  
Monitoring System ◽  
Inference Rules ◽  
Diagnosis System ◽  
Fault Diagnosis System ◽  
Using Data

The coil is the important part of a motor. The traditional monitoring system of the coil can only act when a fault was found. A new fault diagnosis system in motor coil is discussed in the paper. We had built coil fault knowledge base by using data fusion. We had predicted and diagnosed the causes of coil fault quickly by inference rules.

scholarly journals Drug-drug interaction discovery and demystification using Semantic Web technologies

2016 ◽  
Vol 24 (3) ◽  
pp. 556-564 ◽  
Author(s):  
Adeeb Noor ◽  
Abdullah Assiri ◽  
Serkan Ayvaz ◽  
Connor Clark ◽  
Michel Dumontier
Keyword(s):  
Drug Interaction ◽  
Drug Interactions ◽  
Knowledge Base ◽  
Recall Rate ◽  
Inference Rules ◽  
Potential Ddis ◽  
Semantic Web Technologies ◽  
Web Technologies ◽  
Mechanistic Explanations ◽  
Precision Rate

Abstract Objective: To develop a novel pharmacovigilance inferential framework to infer mechanistic explanations for asserted drug-drug interactions (DDIs) and deduce potential DDIs. Materials and Methods: A mechanism-based DDI knowledge base was constructed by integrating knowledge from several existing sources at the pharmacokinetic, pharmacodynamic, pharmacogenetic, and multipathway interaction levels. A query-based framework was then created to utilize this integrated knowledge base in conjunction with 9 inference rules to infer mechanistic explanations for asserted DDIs and deduce potential DDIs. Results: The drug-drug interactions discovery and demystification (D3) system achieved an overall 85% recall rate in terms of inferring mechanistic explanations for the DDIs integrated into its knowledge base, while demonstrating a 61% precision rate in terms of the inference or lack of inference of mechanistic explanations for a balanced, randomly selected collection of interacting and noninteracting drug pairs. Discussion: The successful demonstration of the D3 system’s ability to confirm interactions involving well-studied drugs enhances confidence in its ability to deduce interactions involving less-studied drugs. In its demonstration, the D3 system infers putative explanations for most of its integrated DDIs. Further enhancements to this work in the future might include ranking interaction mechanisms based on likelihood of applicability, determining the likelihood of deduced DDIs, and making the framework publicly available. Conclusion: The D3 system provides an early-warning framework for augmenting knowledge of known DDIs and deducing unknown DDIs. It shows promise in suggesting interaction pathways of research and evaluation interest and aiding clinicians in evaluating and adjusting courses of drug therapy.

scholarly journals Conflict Resolution in Structured Argumentation

10.29007/brgz ◽  
2018 ◽  
Author(s):  
Martin Baláž ◽  
Jozef Frtús ◽  
Martin Homola
Keyword(s):  
Conflict Resolution ◽  
Logic Programming ◽  
Inference Rules ◽  
Logic Programs ◽  
Defeasible Logic ◽  
Structured Argumentation ◽  
Conflict Resolutions

While several interesting argumentation-based semantics fordefeasible logic programs have been proposed, to our bestknowledge, none of these approaches is able to fully handle theclosure under strict rules in a sufficient manner: they are eithernot closed, or they use workarounds such as transposition of ruleswhich violates the desired directionality of logic programmingrules.We propose a novel argumentation-based semantics, in which thestatus of arguments is determined by attacks between newlyintroduced conflict resolutions instead of attacks betweenarguments. We show that the semantics is closed w.r.t. strictrules and respects the directionality of inference rules, as wellas other desired properties previously published in theliterature.

scholarly journals Conflicts in legal knowledge base

2012 ◽  
Vol 37 (2) ◽  
pp. 129-145 ◽  
Author(s):  
Tomasz Zurek
Keyword(s):  
Knowledge Base ◽  
Legal System ◽  
Inference Rules ◽  
Legal Knowledge ◽  
Accurate Representation ◽  
Clear Cut ◽  
Advisory System ◽  
Legal Problems ◽  
Primary Focus

Abstract The simulation of inference processes performed by lawyers can be seen as one way to create advisory legal system. In order to simulate such a process as accurately as possible, it is indispensable to make a clear-cut distinction between the provision itself, and its interpretation and inference mechanisms. This distinction would allow for preserving both the universal character of the provision and its applicability to various legal problems. The authors main objective was to model a selected legal act, together with the inference rules applied, and to represent them in an advisory system, focusing on the most accurate representation of both the content and inference rules. Given that the laws which stand in contradiction prove to be the major challenge, they will constitute the primary focus of this study.

Automatic Dynamic Data Structures Recognition to Support the Migration of Applications to the Cloud

2015 ◽  
Vol 7 (3) ◽  
pp. 1-22 ◽  
Author(s):  
Beniamino Di Martino ◽  
Antonio Esposito
Keyword(s):  
Knowledge Base ◽  
Data Structures ◽  
Source Code ◽  
Cloud Services ◽  
Inference Rules ◽  
Dynamic Data Structures ◽  
Dynamic Data ◽  
Complex Processes ◽  
Parallel Skeletons ◽  
Cloud Patterns

The work presented in this manuscript describes a methodology for the recognition of Dynamic Data structures, with a focus on Queues, Pipes and Lists. The recognition of such structures is used as a basis for the mapping of sequential code to Cloud Services, in order to support the semi-automatic restructuring of source software. The goal is to develop a complete methodology and a framework based on it to ease the efforts needed to port native applications to a Cloud Platform and simplify the relative complex processes. In order to achieve such an objective, the proposed technique exploits an intermediate representation of the code, consisting in parallel Skeletons and Cloud Patterns. Logical inference rules act on a knowledge base, built during the analysis of the source code, to guide the recognition and mapping processes. Both the inference rules and knowledge base are expressed in Prolog. A prototype tool for the automatic analysis of sequential source code and its mapping to a Cloud Pattern is also presented.

Sign in / Sign up

Export Citation Format

Share Document