1,142 research outputs found
Theme Aspect Argumentation Model for Handling Fallacies
From daily discussions to marketing ads to political statements, information
manipulation is rife. It is increasingly more important that we have the right
set of tools to defend ourselves from manipulative rhetoric, or fallacies.
Suitable techniques to automatically identify fallacies are being investigated
in natural language processing research. However, a fallacy in one context may
not be a fallacy in another context, so there is also a need to explain how and
why it has come to be judged a fallacy. For the explainable fallacy
identification, we present a novel approach to characterising fallacies through
formal constraints, as a viable alternative to more traditional fallacy
classifications by informal criteria. To achieve this objective, we introduce a
novel context-aware argumentation model, the theme aspect argumentation model,
which can do both: the modelling of a given argumentation as it is expressed
(rhetorical modelling); and a deeper semantic analysis of the rhetorical
argumentation model. By identifying fallacies with formal constraints, it
becomes possible to tell whether a fallacy lurks in the modelled rhetoric with
a formal rigour. We present core formal constraints for the theme aspect
argumentation model and then more formal constraints that improve its fallacy
identification capability. We show and prove the consequences of these formal
constraints. We then analyse the computational complexities of deciding the
satisfiability of the constraints
Program transformation for functional circuit descriptions
We model sequential synchronous circuits on the logical level by signal-processing programs in an extended lambda calculus Lpor with letrec, constructors, case and parallel or (por) employing contextual equivalence. The model describes gates as (parallel) boolean operators, memory using a delay, which in turn is modeled as a shift of the list of signals, and permits also constructive cycles due to the parallel or. It opens the possibility of a large set of program transformations that correctly transform the expressions and thus the represented circuits and provides basic tools for equivalence testing and optimizing circuits. A further application is the correct manipulation by transformations of software components combined with circuits. The main part of our work are proof methods for correct transformations of expressions in the lambda calculus Lpor, and to propose the appropriate program transformations
A Plausibility Semantics for Abstract Argumentation Frameworks
We propose and investigate a simple ranking-measure-based extension semantics
for abstract argumentation frameworks based on their generic instantiation by
default knowledge bases and the ranking construction semantics for default
reasoning. In this context, we consider the path from structured to logical to
shallow semantic instantiations. The resulting well-justified JZ-extension
semantics diverges from more traditional approaches.Comment: Proceedings of the 15th International Workshop on Non-Monotonic
Reasoning (NMR 2014). This is an improved and extended version of the
author's ECSQARU 2013 pape
Software Engineering and Complexity in Effective Algebraic Geometry
We introduce the notion of a robust parameterized arithmetic circuit for the
evaluation of algebraic families of multivariate polynomials. Based on this
notion, we present a computation model, adapted to Scientific Computing, which
captures all known branching parsimonious symbolic algorithms in effective
Algebraic Geometry. We justify this model by arguments from Software
Engineering. Finally we exhibit a class of simple elimination problems of
effective Algebraic Geometry which require exponential time to be solved by
branching parsimonious algorithms of our computation model.Comment: 70 pages. arXiv admin note: substantial text overlap with
arXiv:1201.434
- …