A Discussion Game for the Credulous Decision Problem of Abstract Dialectical Frameworks under Preferred Semantics

Abstract dialectical frameworks (ADFs) have been introduced as a general formalism for modeling and evaluating argumentation. However, the role of discussion in reasoning in ADFs has not been clarified well so far. The current work presents a discussion game, as a proof method, to answer credulous decision problems of ADFs under preferred semantics. The game can be the basis for an algorithm that can be used not only for answering the decision problem but also for human-machine interaction

Online Handbook of Argumentation for AI: Volume 1

This volume contains revised versions of the papers selected for the first volume of the Online Handbook of Argumentation for AI (OHAAI). Previously, formal theories of argument and argument interaction have been proposed and studied, and this has led to the more recent study of computational models of argument. Argumentation, as a field within artificial intelligence (AI), is highly relevant for researchers interested in symbolic representations of knowledge and defeasible reasoning. The purpose of this handbook is to provide an open access and curated anthology for the argumentation research community. OHAAI is designed to serve as a research hub to keep track of the latest and upcoming PhD-driven research on the theory and application of argumentation in all areas related to AI.Comment: editor: Federico Castagna and Francesca Mosca and Jack Mumford and Stefan Sarkadi and Andreas Xydi

Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments arecalled semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. Recently, the notion of strong admissibility has been introduced for ADFs. In the current work we study the computational complexityof the following reasoning tasks under strong admissibility semantics. We address 1. the credulous/skeptical decision problem; 2. the verification problem; 3. the strong justification problem; and 4. the problem of finding a smallest witness of strong justification of a queried argument

The local geometry of multiattribute tradeoff preferences

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 125-129).Existing preference reasoning systems have been successful in simple domains. Broader success requires more natural and more expressive preference representations. This thesis develops a representation of logical preferences that combines numerical tradeoff ratios between partial outcome descriptions with qualitative preference information. We argue our system is unique among preference reasoning systems; previous work has focused on qualitative or quantitative preferences, tradeoffs, exceptions and generalizations, or utility independence, but none have combined all of these expressions under a unified methodology. We present new techniques for representing and giving meaning to quantitative tradeoff statements between different outcomes. The tradeoffs we consider can be multi-attribute tradeoffs relating more than one attribute at a time, they can refer to discrete or continuous domains, be conditional or unconditional, and quantified or qualitative. We present related methods of representing judgments of attribute importance. We then build upon a methodology for representing arbitrary qualitative ceteris paribus preference, or preferences "other things being equal," as presented in [MD04].(cont.) Tradeoff preferences in our representation are interpreted as constraints on the partial derivatives of the utility function. For example, a decision maker could state that "Color is five times as important as price, availability, and time," a sentiment one might express in the context of repainting a home, and this is interpreted as indicating that utility increases in the positive color direction five times faster than utility increases in the positive price direction. We show that these representations generalize both the economic notion of marginal rates of substitution and previous representations of preferences in AI.by Michael McGeachie.Ph.D

Local Geometry of Multiattribute Tradeoff Preferences

PhD thesisExisting preference reasoning systems have been successful insimple domains. Broader success requires more natural and moreexpressive preference representations. This thesis develops arepresentation of logical preferences that combines numericaltradeoff ratios between partial outcome descriptions withqualitative preference information. We argue our system is uniqueamong preference reasoning systems; previous work has focused onqualitative or quantitative preferences, tradeoffs, exceptions andgeneralizations, or utility independence, but none have combinedall of these expressions under a unified methodology.We present new techniques for representing and giving meaning toquantitative tradeoff statements between different outcomes. Thetradeoffs we consider can be multi-attribute tradeoffs relatingmore than one attribute at a time, they can refer to discrete orcontinuous domains, be conditional or unconditional, andquantified or qualitative. We present related methods ofrepresenting judgments of attribute importance. We then buildupon a methodology for representing arbitrary qualitative ceteris paribuspreference, or preferences ``other things being equal," aspresented in MD04. Tradeoff preferences inour representation are interpreted as constraints on the partialderivatives of the utility function. For example, a decision makercould state that ``Color is five times as important as price,availability, and time," a sentiment one might express in thecontext of repainting a home, and this is interpreted asindicating that utility increases in the positive color directionfive times faster than utility increases in the positive pricedirection. We show that these representations generalize both theeconomic notion of marginal rates of substitution and previousrepresentations of preferences in AI