Sciweavers

Share
7 search results - page 1 / 2
» The Computational Complexity of Ideal Semantics I: Abstract ...
Sort
View
AI
2002
Springer
8 years 11 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
AI
2015
Springer
3 years 7 months ago
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
g the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory Hannes Strass Computer Science Institute Leipzig University, Germany Johannes Pe...
Hannes Strass, Johannes Peter Wallner
AI
2002
Springer
8 years 11 months ago
Coherence in finite argument systems
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
Paul E. Dunne, Trevor J. M. Bench-Capon
ICMI
2003
Springer
164views Biometrics» more  ICMI 2003»
9 years 4 months ago
A visually grounded natural language interface for reference to spatial scenes
Many user interfaces, from graphic design programs to navigation aids in cars, share a virtual space with the user. Such applications are often ideal candidates for speech interfa...
Peter Gorniak, Deb Roy
books