Sciweavers

1094 search results - page 110 / 219
» On Computing Explanations in Argumentation
Sort
View
SIGCSE
1997
ACM
111views Education» more  SIGCSE 1997»
15 years 3 months ago
Function objects, function templates, and passage by behavior in C++
Passing functions and function objects to general routines is a powerful abstraction mechanism that should be taught in freshman computer science. In C++, a “function” can be ...
Richard Rasala
DCG
2010
146views more  DCG 2010»
14 years 8 months ago
An Elementary Deduction of the Topological Radon Theorem from Borsuk-Ulam
Abstract. The Topological Radon Theorem states that, for every continuous function from the boundary of a (d + 1)-dimensional simplex into Rn , there exist a pair of disjoint faces...
Craig R. Guilbault
MICS
2010
62views more  MICS 2010»
14 years 6 months ago
Linear Differential Elimination for Analytic Functions
This paper provides methods to decide whether a given analytic function of several complex variables is a linear combination of finitely many given analytic functions with coeffic...
Wilhelm Plesken, Daniel Robertz
ARGMAS
2005
Springer
15 years 4 months ago
Testing Formal Dialectic
Systems of argumentation or ’computational dialectic’ are emerging as a powerful means of structuring inter-agent communication in multi-agent systems. Individual systems of co...
Simon Wells, Chris Reed
STACS
1993
Springer
15 years 3 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob