322,898 research outputs found
14th International Workshop on Nonmonotonic Reasoning
No full textSi veda sito web http://www.dbai.tuwien.ac.at/NMR12
Ranking-based semantics from the perspective of claims
No full textThe paper provides an initial study on how ranking semantics in argumentation have to be handled when leaving the purely abstract setting. We employ claim-augmented frameworks where each argument is associated to a claim it stands for. We propose liftings from argument-to claim-level in two veins: for desired properties and for actual rankings. Our main contribution is to investigate whether the satisfaction of properties by argument-based ranking semantics carries over to the lifted, claim-based, variants of the corresponding properties and semantics
Strong Equivalence of Qualitative Optimization Problems
No full textWe introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describe the space of outcomes to be compared (the generator) and the preferences on outcomes (the selector). We consider two types of optimization problems. They differ in the way the generator, which we model by a propositional theory, is interpreted: by the standard propositional logic semantics, and by the equilibrium-model (answer-set) semantics. Under the latter interpretation of generators, optimization problems directly generalize answer-set optimization programs proposed previously. We study strong equivalence of optimization problems, which guarantees their interchangeability within any larger context. We characterize several versions of strong equivalence obtained by restricting the class of optimization problems that can be used as extensions and establish the complexity of associated reasoning tasks. Understanding strong equivalence is essential for modular representation of optimization problems and rewriting techniques to simplify them without changing their inherent properties
Diffusive author(s), cohesive author: Analysis of S/N (1994)
No full textThis study indicates the ways in which various aspects of the author(s) are brought forth in Dumb type’s performance art, the S/N production. Previous research has suggested a non-hierarchical organization of Dumb type and the absence of a “privileged author” in Dumb type’s collaborative work, S/N. However, the results that I have investigated from member’s interviews on the creative process of S/N along with my analysis of the recorded images of S/N, indicate a different aspect of the author(s). First, S/N was created through, so to speak, the collective ideas of the members of Dumb type. Further, S/N has at least nine quotations from previous performances, installations, and printed writings, besides the work-in-progress technique. Explicating one of the “author functions” as given by Michel Foucault, each text has plural subjects of the author. However, it has been revealed from members’ interviews that Teiji Furuhashi had a decision-making role in selecting the members’ ideas within the performance. Since then, S/N has had plural subjects of creation; however, Furuhashi is one of the subjects of creation along with the “privileged author.” S/N has plural authors (diffusive authors) yet at the same time, it has a “privileged author,” Teiji Furuhashi (cohesive author)
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Complexity of super-coherence problems in ASP
No full textAdapting techniques from database theory in order to optimize Answer Set Programming
(ASP) systems, and in particular the grounding components of ASP systems, is an important
topic in ASP. In recent years, the Magic Set method has received some interest in this setting,
and a variant of it, called Dynamic Magic Set, has been proposed for ASP. However, this
technique has a caveat, because it is not correct (in the sense of being query-equivalent)
for all ASP programs. In a recent work, a large fragment of ASP programs, referred to as
super-coherent programs, has been identified, for which Dynamic Magic Set is correct. The
fragment contains all programs which possess at least one answer set, no matter which set of
facts is added to them. Two open question remained: How complex is it to determine whether
a given program is super-coherent? Does the restriction to super-coherent programs limit
the problems that can be solved? Especially the first question turned out to be quite difficult
to answer precisely. In this paper, we formally prove that deciding whether a propositional
P
P
program is super-coherent is Π3 -complete in the disjunctive case, while it is Π2 -complete for
normal programs. The hardness proofs are the difficult part in this endeavor: We proceed
by characterizing the reductions by the models and reduct models which the ASP programs
should have, and then provide instantiations that meet the given specifications. Concerning
the second question, we show that all relevant ASP reasoning tasks can be transformed into
tasks over super-coherent programs, although this transformation is more of theoretical than
practical interest
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving
No full textAbstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity
poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) empirically evaluating a resulting implementation which relies on calls to SAT solvers
Author's address:
No full textCan archives of audiovisual TV interviews be used to make authors more visible to students, and thereby reduce the learning gap between native and non-native language speakers in college classes? We examined students in a college course who learned about one scholar's ideas through watching an audiovisual TV interview (i.e., visible author format) and about another scholar's ideas through reading a formal text description (i.e., invisible author format). For the invisible author, native language speakers scored significantly higher than the non-native language speakers on a corresponding exam question (i.e., a cognitive measure), generated more words on the exam question (i.e., a motivational measure), and mentioned the author's name more often in answering the exam question (i.e., an affective measure). For the visible author, the groups did not differ on any of these measures. These findings provide evidence for the idea that making the author visible through audiovisual TV interviews can eliminate the learning gap between native and non-native language speakers. 3 Universities around the world serve students who are non-native speakers of th
- …
