512,546 Hits in 5.1 sec

Argumentative Approaches to Reasoning with Consistent Subsets of Premises [chapter]

Ofer Arieli, AnneMarie Borg, Christian Straßer
2017 Lecture Notes in Computer Science  
It has been shown that entailments based on the maximally consistent subsets (MCS) of a given set of premises can be captured by Dung-style semantics for argumentation frameworks.  ...  The introduction of declarative methods for reasoning with MCS by means of (sequent-based) argumentation frameworks provides, in particular, a better understanding of logic-based argumentation and allows  ...  Reasoning with Maximally Consistent Subsets As indicated previously, our primary goal in this work is to provide argumentative approaches for reasoning with inconsistent premises by their (maximally) consistent  ... 
doi:10.1007/978-3-319-60042-0_50 fatcat:2niguivcivdwhjxpnnifkbtfbm

OUP accepted manuscript

2018 Journal of Logic and Computation  
Reasoning with the maximally consistent subsets (MCS) of the premises is a well-known approach for handling contradictory information.  ...  As a by-product of this we obtain soundness and completeness results for the dynamic proof systems with respect to several of Dung's semantics.  ...  Acknowledgements The first two authors are supported by the Israel Science Foundation (grant 817/15), and the last two authors are supported by the Alexander von Humboldt Foundation and the German Ministry  ... 
doi:10.1093/logcom/exy027 fatcat:ctjusssoa5hg7ejvtvcapuejxu

Argumentative inference in uncertain and inconsistent knowledge bases [article]

Salem Benferhat, Didier Dubois, Henri Prade
2013 arXiv   pre-print
A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is particularly  ...  This paper presents and discusses several methods for reasoning from inconsistent knowledge bases.  ...  A preferred sub-base L i is constructed by starting with a maximal consistent sub-base of B 1, then we add to L i as many formulas of B z as possible (wrt to consistency criterion), and so on.  ... 
arXiv:1303.1503v1 fatcat:rgcfv2gdrze7bl63ufrkkytamq

A logic-based theory of deductive arguments☆☆This is an extended version of a paper entitled "Towards a logic-based theory of argumentation" published in the Proceedings of the National Conference on Artificial Intelligence (AAAI'2000), Austin, TX, MIT Press, Cambridge, MA, 2000

Philippe Besnard, Anthony Hunter
2001 Artificial Intelligence  
We compare our framework with a number of other types of argument systems, and finally discuss an application in reasoning with structured news reports.  ✩ This is an extended version of a paper entitled  ...  We explore a framework for argumentation (based on classical logic) in which an argument is a pair where the first item in the pair is a minimal consistent set of formulae that proves the second item (  ...  Acknowledgements This work has been partly funded by the ESPRIT Fusion Project.  ... 
doi:10.1016/s0004-3702(01)00071-6 fatcat:b6fqkb2ztja53czev5iyu6tq74

An argumentation theoretic semantics based on non-refutable falsity [chapter]

José Júlio Alferes, Luís Moniz Pereira
1995 Lecture Notes in Computer Science  
An agent sustaining argument not b cannot be refuted by any consistent set of arguments. To maximally reduce unde nedness we need to identify maximal sustainable sets of assumptions.  ...  So, and in order to de ne a unique semantics given by a single set of additional assumptions, a rst approach would be to add only those assumptions common to all maximal sets, i.e. those arguments that  ... 
doi:10.1007/bfb0030657 fatcat:csi6rotn3jearjnljjzfgac6xu

Toward Justifying Actions with Logically and Socially Acceptable Reasons [chapter]

Hiroyuki Kido, Katsumi Nitta
2011 Lecture Notes in Computer Science  
Note that argument-based reasoning consisting of P RAF P P O , P RAF NP O and P RAF SW concludes that using ANA is supported by Pareto optimal, social welfare maximizing, and nonmonotonic consequence reasons  ...  Reasoning operates on a default theory T = (F, D) and a set G i (1 ≤ i ≤ n) of agents' desires, where F is a consistent subset of L 0 , D is a subset of L 1 , and G i is a consistent subset of L 0 with  ... 
doi:10.1007/978-3-642-25324-9_5 fatcat:asjrr64cavh2tfvasveaqmydv4

Handling Inconsistency with Preference-Based Argumentation [chapter]

Leila Amgoud, Srdjan Vesic
2010 Lecture Notes in Computer Science  
Argumentation is a promising approach for handling inconsistent knowledge bases, based on the justification of plausible conclusions by arguments.  ...  Due to inconsistency, arguments may be attacked by counterarguments. The problem is thus to evaluate the arguments in order to select the most acceptable ones.  ...  Argumentation is one of these approaches. Its basic idea is that each plausible conclusion inferred from the knowledge base is justified by some reason(s), called argument(s), for believing in it.  ... 
doi:10.1007/978-3-642-15951-0_11 fatcat:sdav6mfhhjf75pr5wjl5zmfl2a

Introduction to Inconsistency Tolerance [chapter]

Leopoldo Bertossi, Anthony Hunter, Torsten Schaub
2005 Lecture Notes in Computer Science  
To address this, inconsistency tolerance is being built on foundational technologies for identifying and analysing inconsistency in information, for representing and reasoning with inconsistent information  ...  Examples include: Merging information from heterogeneous sources; Negotiation in multi-agent systems; Understanding natural language dialogues; and Commonsense reasoning in robotics.  ...  Arguments can then be defined as chains of reasons leading to a conclusion with consideration of potential defeaters at each step.  ... 
doi:10.1007/978-3-540-30597-2_1 fatcat:kzpzrg6vtzgbzegepljcpjtyai

Correct Grounded Reasoning with Presumptive Arguments [chapter]

Bart Verheij
2016 Lecture Notes in Computer Science  
We address the semantics and normative questions for reasoning with presumptive arguments: How are presumptive arguments grounded in interpretations; and when are they evaluated as correct?  ...  Arguments are evaluated as presumptively valid when they make a case that is maximally preferred.  ...  The resulting formalism models correct grounded reasoning with presumptive arguments.  ... 
doi:10.1007/978-3-319-48758-8_31 fatcat:rsmtoe6jvrdl5pfd4u3xxbiz3i

Beyond Maxi-Consistent Argumentation Operators [chapter]

Srdjan Vesic, Leendert van der Torre
2012 Lecture Notes in Computer Science  
It was shown by Cayrol in 1995 that if direct undercut is used, then stable extensions of an argumentation system correspond exactly to maximal (for set inclusion) consistent subsets of the knowledge base  ...  to the maximal consistent subsets of the knowledge base used for constructing arguments.  ...  Note that by following the approach we describe in this section, one obtains a refinement of the approach returning extensions corresponding to the maximal consistent subsets of the knowledge base.  ... 
doi:10.1007/978-3-642-33353-8_33 fatcat:zm2emku2m5bcxlmoiv2nhcdmm4

Argumentation-Based Reasoning with Inconsistent Knowledge Bases [chapter]

Xiaowang Zhang, Zhihu Zhang, Dai Xu, Zuoquan Lin
2010 Lecture Notes in Computer Science  
In this paper, we present an argumentation-based approach to dealing with inconsistency occurring in knowledge bases.  ...  We investigate several important logical properties of such an argumentation-based entailment relation and show its promising advantages in paraconsistent reasoning for inconsistent knowledge bases.  ...  This work is supported by the program of the National Natural Science Foundation of China (NSFC) under grant number 60973003.  ... 
doi:10.1007/978-3-642-13059-5_11 fatcat:yupkl66orbepfix5jmzwxi5tky

An Argumentation-Based Approach for Computing Inconsistency Degree in Possibilistic Lightweight Ontologies

Khaoula Boutouhami, Ibrahim Hussein Musa
2019 Journal of Physics, Conference Series  
Reasoning with inconsistent ontologies plays an important role in Semantic Web applications.  ...  In this paper, we are interested in using the argumentation for the inconsistency degree of uncertain knowledge bases expressed in possibilistic DL-Lite (the key notion in reasoning from a possibilistic  ...  Acknowledgments This work was supported by National Key R&D Program of China (2018YFC0830200) and National Natural Science Foundation of China Key Project (U1736204).  ... 
doi:10.1088/1742-6596/1229/1/012081 fatcat:isxorba77zh2leun5qephbb5tq

Comparing the Argumentum Model of Topics to Other Contemporary Approaches to Argument Schemes: The Procedural and Material Components

Eddo Rigotti, Sara Greco Morasso
2010 Argumentation: an international journal on reasoning  
This paper focuses on the inferential configuration of arguments, generally referred to as argument scheme.  ...  After outlining our approach, denominated Argumentum Model of Topics (AMT, see Rigotti and Greco  ...  the first component of the maxim introduced by ''if'': we expect that the final conclusion will coincide with an instance of the second component of the maxim (beginning with ''then'').  ... 
doi:10.1007/s10503-010-9190-7 fatcat:z4f7zpgjovemxfwvbiw2wunoqy

Rich preference-based argumentation frameworks

Leila Amgoud, Srdjan Vesic
2014 International Journal of Approximate Reasoning  
Things are different for the other approaches for defeasible reasoning (e.g., [24] [25] [26] ).  ...  The last contribution of the paper consists of applying our rich framework for reasoning about inconsistency.  ...  The main reason behind the dysfunction of the existing approach is that by removing an attack, a crucial information is lost. In what follows, we propose a novel approach which palliates this limit.  ... 
doi:10.1016/j.ijar.2013.10.010 fatcat:nwtlyenxj5e5tpluf7vtxzevie

Identifying the Class of Maxi-Consistent Operators in Argumentation

S. Vesic
2013 The Journal of Artificial Intelligence Research  
Dung's abstract argumentation theory can be seen as a general framework for non-monotonic reasoning.  ...  In other words, we study the class of instantiations where very extension of the argumentation system corresponds to exactly one maximal consistent subset of the knowledge base.  ...  Maxi-Consistent Operators in Argumentation. Proceedings of the 20th European Conference on Artificial Intelligence (ECAI'12), pages 810-815.  ... 
doi:10.1613/jair.3860 fatcat:2bhsa6n3m5gf5o5ru5h2d5ujme
« Previous Showing results 1 — 15 out of 512,546 results