Sciweavers

6 search results - page 1 / 2
» The Computational Complexity of Ideal Semantics I: Abstract ...
Sort
View
AI
2002
Springer
13 years 4 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
2002
Springer
13 years 4 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»
13 years 9 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
AAMAS
2008
Springer
13 years 4 months ago
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...