1,003 Hits in 4.3 sec

Arguments and defeat in argument-based nonmonotonic reasoning [chapter]

Bart Verheij
1995 Lecture Notes in Computer Science  
In this paper, we argue for four points that are refinements of how arguments and defeat have been used in argument-based nonmonotonic reasoning.  ...  Argument-based formalisms are gaining popularity as models of nonmonotonic reasoning. Central in such formalisms is a notion of argument.  ...  Conclusions This paper is an example of the argument-based approach to nonmonotonic reasoning.  ... 
doi:10.1007/3-540-60428-6_18 fatcat:s4h5kitxxvakzfcgvrq6kbdubm

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

Hiroyuki Kido, Katsumi Nitta
2011 Lecture Notes in Computer Science  
The aim of this paper is to formalize argument-based reasoning for actions supported by believable reasons in terms of nonmonotonic consequences and desirable reasons in terms of Pareto optimality and  ...  Conclusions and Future Work This paper proposed argument-based reasoning for actions supported by believable reasons in terms of nonmonotonic consequences and desirable reasons in terms of Pareto optimal  ... 
doi:10.1007/978-3-642-25324-9_5 fatcat:asjrr64cavh2tfvasveaqmydv4

Logics for Defeasible Argumentation [chapter]

Henry Prakken, Gerard Vreeswijk
2001 Handbook of Philosophical Logic  
A ag-based reasoner consists of an inference engine that produces all arguments eventually, and a component computing the defeat status of arguments.  ...  For some non-argument-based nonmonotonic logics that deal with this phenomenon, see Grosof 1993], Brewka 1994a], Prakken 1995] and Hage 1997] .  ... 
doi:10.1007/978-94-017-0456-4_3 fatcat:43zmm2soqfbbpa56sp5s7gby6e

Semantics for a theory of defeasible reasoning

Quoc Bao Vo, Norman Y. Foo, Joe Thurbon
2005 Annals of Mathematics and Artificial Intelligence  
In also enforces a well-defined semantical account for Pollock's theory of defeasible reasoning based on the argumentation-theoretic approach proposed by Dung and Bondarenko et al. [1, 5] .  ...  In this paper, we establish a formal semantics for Pollock's [23] theory of defeasible reasoning.  ...  This research was partially supported by the research grants and scholarships (APA for Joe Thurbon and OPRS for Quoc Bao Vo) provided by the ARC.  ... 
doi:10.1007/s10472-005-1807-4 fatcat:m7xibh4iaffxjc4k36wxzvi7hq

Logical models of argument

Carlos Iván Chesñevar, Ana Gabriela Maguitman, Ronald Prescott Loui
2000 ACM Computing Surveys  
in different complex systems for real-world applications, and allows more formal work to be done in different areas, such as AI and Law, case-based reasoning and negotiation among intelligent agents.  ...  We trace the evolution of argumentation from the mid-1980s, when argument systems emerged as an alternative to nonmonotonic formalisms based on classical logic, to the present, as argument is embedded  ...  ACKNOWLEDGMENTS We want to thank anonymous referees for suggestions and comments that helped to improve the structure of the first version of this paper. Computación (Oct.) Ciencias de la  ... 
doi:10.1145/371578.371581 fatcat:fcifpsaik5hd7diovit5h67p7e

Analysing reasoning about evidence with formal models of argumentation

H. Prakken
2004 Law, Probability and Risk  
Such logics model reasoning as the construction and comparison of arguments for and against a conclusion; this makes them very suitable for capturing the adversarial aspects that are so typical for legal  ...  In particular, the use of logics for defeasible argumentation is investigated.  ...  Argumentation systems formalise nonmonotonic reasoning in terms of the dialectical interaction between arguments and counterarguments.  ... 
doi:10.1093/lpr/3.1.33 fatcat:ycf7q6k23ja4lhodmxpb2jdefa

Two approaches to the formalisation of defeasible deontic reasoning

Henry Prakken
1996 Studia Logica: An International Journal for Symbolic Logic  
nonmonotonic reasoning.  ...  This paper compares two ways of formalising defeasible deontic reasoning, both based on the view that the issues of con icting obligations and moral dilemmas should be dealt with from the perspective of  ...  As the nonmonotonic formalism I shall use my formal argumentation framework based on default logic ( 20, 22] ).  ... 
doi:10.1007/bf00370670 fatcat:dnrh3wjg6fc3pdnu5x22fsiwhe

Some Reflections on Two Current Trends in Formal Argumentation [chapter]

Henry Prakken
2012 Lecture Notes in Computer Science  
It is first argued that general models of the use of preferences in argumentation cannot leave the structure of arguments and the nature of attack and defeat unspecified.  ...  This paper discusses two recent developments in the formal study of argumentation-based inference: work on preference-based abstract argumentation and on classical (deductive) argumentation.  ...  I thank all three reviewers for their many valuable suggestions and one of them in particular for triggering the discussion in footnote 10.  ... 
doi:10.1007/978-3-642-29414-3_14 fatcat:anqb52lwlrfrfaisumgu3dquvu

Dialectical proof theory for defeasible argumentation with defeasible priorities (preliminary report) [chapter]

Henry Prakken
1999 Lecture Notes in Computer Science  
A main feature of the proof theory is that it also applies to systems in which reasoning about the standards for comparing arguments is possible.  ...  In this paper a dialectical proof theory is proposed for logical systems for defeasible argumentation that t a certain format.  ...  In such systems nonmonotonic reasoning is analyzed in terms of the interactions between arguments for alternative conclusions.  ... 
doi:10.1007/3-540-46581-2_14 fatcat:azbw7a5s7jdtnj6r2jriqk6qmi

Propositional Argumentation and Causal Reasoning

Alexander Bochman
2005 International Joint Conference on Artificial Intelligence  
The implications of this correspondence for the respective nonmonotonic theories of argumentation and causal reasoning are discussed.  ...  In addition, a stronger argumentation system in a full classical language will be shown to be equivalent to a system of causal reasoning [Giunchiglia et al., 2004] .  ...  Both the argumentation theory and theory of causal nonmonotonic reasoning have proved to be powerful frameworks for representing different kinds of nonmonotonic reasoning, including traditional nonmonotonic  ... 
dblp:conf/ijcai/Bochman05 fatcat:dk5t7skqebazjlnnerjl7s3tde

Relating DeLP and Default Logic

Telma Delladio, G.R. Simari
2007 Inteligencia Artificial  
In this paper, we establish a relation between an argumentation based system: Defeasible Logic Programming (DELP), and a nonmonotonic system: Reiter's Default Logic.  ...  Thus, this work establishes a link between a well understood nonmonotonic system and a argumentation based system.  ...  Thanks to Nicolás Rotstein for his useful comments and remarks.  ... 
doi:10.4114/ia.v11i35.904 fatcat:4j737ffbzrbgbas57uagmiwjmu

A theory of defeasible reasoning

John L. Pollock
1991 International Journal of Intelligent Systems  
In philosophy, this is described by saying that reasoning is defeasible. In AI, it is described by saying that reasoning is nonmonotonic.  ...  My ultimate objective is the construction of a general theory of reasoning and its implementation in an automated reasoner capable of both deductive and defeasible reasoning.  ...  Inverse In statistical reasoning, it is very common to have an argument for p based upon an instance of Inverse Statistical Syllogism in which the probability is r, and an argument for i p based upon an  ... 
doi:10.1002/int.4550060103 fatcat:wapc3tzy3jardf3osd3hdbua3e

The Feasibility of Defeat in Defeasible Reasoning [chapter]

Gerard Vreeswijk
1993 Diamonds and Defaults  
I claim that sensible criteria of defeat among arguments in those systems are feasible, be it to a certain extent.  ...  Systems of defeasible reasoning are characterized by defeasible proofs, called arguments.  ...  Finally many thanks to Irene Baker for her efforts in proofreading.  ... 
doi:10.1007/978-94-015-8242-1_13 fatcat:7by2sqoyejfcpnag3ubplotthi

Logical Modes of Attack in Argumentation Networks

Dov M. Gabbay, Artur S. d'Avila Garcez
2009 Studia Logica: An International Journal for Symbolic Logic  
We define consequence relations based on a notion of defeat, consider rationality postulates, and prove that one such consequence relation is consistent.  ...  This paper studies methodologically robust options for giving logical contents to nodes in abstract argumentation networks.  ...  Its literal base is {t : x} and its subarguments are ∅. 2. Let π 1 , . . . , π n be arguments in ∆ of level m i , and let ρ : (x 1 , . . . , x n ) ⇒ x be a defeasible rule in ∆.  ... 
doi:10.1007/s11225-009-9216-z fatcat:yfs6fraa3fa4vpyduy3klws5e4

Argumentation Semantics for Defeasible Logics [chapter]

G. Governatori, M. J. Maher, G. Antoniou, D. Billington
2000 Lecture Notes in Computer Science  
Argumentation-based semantics have become popular in the area of logic programming. In this paper we give an argumentation-based semantics for defeasible logic.  ...  It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the modelling of business rules. So far defeasible logic has been defined only proof-theoretically.  ...  Acknowledgments We thank Alejandro Garcia for fruitful discussions on defeasible logic and argumentation. This research was supported by the Australia Research Council under Large Grant No. A49803544.  ... 
doi:10.1007/3-540-44533-1_7 fatcat:r3ij7737hbhjdej7chqldpkdai
« Previous Showing results 1 — 15 out of 1,003 results