Sciweavers

1094 search results - page 82 / 219
» On Computing Explanations in Argumentation
Sort
View
LPNMR
1997
Springer
15 years 3 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
COMPGEOM
2001
ACM
15 years 2 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
82
Voted
AAAI
2007
15 years 1 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
WWW
2011
ACM
14 years 6 months ago
Analysis and tracking of emotions in english and bengali texts: a computational approach
The present discussion highlights the aspects of an ongoing doctoral thesis grounded on the analysis and tracking of emotions from English and Bengali texts. Development of lexica...
Dipankar Das
FOCS
2003
IEEE
15 years 4 months ago
Lower Bounds for Non-Black-Box Zero Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Boaz Barak, Yehuda Lindell, Salil P. Vadhan