Sciweavers

178 search results - page 9 / 36
» Dependability Arguments with Trusted Bases
Sort
View
JAR
2006
87views more  JAR 2006»
13 years 7 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
ARGMAS
2009
Springer
14 years 2 months ago
Comparing Argumentation Frameworks for Composite Ontology Matching
Resolving the semantic heterogeneity problem is crucial to allow interoperability between ontology-based systems. Ontology matching based on argumentation is an innovative research...
Cássia Trojahn dos Santos, Paulo Quaresma, ...
IMC
2005
ACM
14 years 29 days ago
Perils of Transitive Trust in the Domain Name System
The Domain Name System, DNS, is based on nameserver delegations, which introduce complex and subtle dependencies between names and nameservers. In this paper, we present results f...
Venugopalan Ramasubramanian, Emin Gün Sirer
ATAL
2006
Springer
13 years 11 months ago
Adaptive agent negotiation via argumentation
In this paper, we study how argumentation can be used as a basis for negotiation between autonomous agents, where negotiation strategies of the different parties are represented a...
Antonis C. Kakas, Pavlos Moraitis
CHI
2003
ACM
14 years 7 months ago
Interpersonal cues and consumer trust in e-commerce
E-commerce stretches interactions over space and time, and thus requires more trust than traditional shopping. Current approaches to building trust in e-commerce focus on cognitiv...
Jens Riegelsberger