Sciweavers

1094 search results - page 52 / 219
» On Computing Explanations in Argumentation
Sort
View
120
Voted
NETCOOP
2009
Springer
15 years 5 months ago
Competition and Cooperation between Nodes in Delay Tolerant Networks with Two Hop Routing
This paper revisits the two-hop forwarding policy in delay tolerant networks (DTNs) using simple probabilistic arguments. Closed form expressions are derived for the main performan...
Eitan Altman
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
15 years 11 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
SEMWEB
2009
Springer
15 years 5 months ago
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...
Ken Kaneiwa, Philip H. P. Nguyen
85
Voted
ARGMAS
2004
Springer
15 years 4 months ago
Bargaining and Argument-Based Negotiation:
Abstract. Argumentation-based techniques are being increasingly used to construct frameworks for flexible negotiation among computational agents. Despite the advancements made to ...
Iyad Rahwan, Liz Sonenberg, Peter McBurney
88
Voted
DALT
2008
Springer
15 years 20 days ago
Strategic Agent Communication: An Argumentation-Driven Approach
Abstract. This paper proposes a formal framework for agent communication where agents can reason about their goals using strategic reasoning. This reasoning is argumentation-based ...
Jamal Bentahar, Mohamed Mbarki, John-Jules Ch. Mey...