Sciweavers

1912 search results - page 27 / 383
» On the evaluation of argumentation formalisms
Sort
View
AIL
2000
78views more  AIL 2000»
14 years 11 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
ARGMAS
2006
Springer
15 years 3 months ago
Specification and Complexity of Strategic-Based Reasoning Using Argumentation
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
Mohamed Mbarki, Jamal Bentahar, Bernard Moulin
AI
2002
Springer
14 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
SYNTHESE
2008
51views more  SYNTHESE 2008»
14 years 11 months ago
Rebutting formally valid counterexamples to the Humean "is-ought" dictum
Various formally valid counterexamples have been adduced against the Humean dictum that one cannot derive an "ought" from an "is." There are formal rebuttals--s...
Daniel Guevara
DSOM
2006
Springer
15 years 3 months ago
Using Argumentation Logic for Firewall Policy Specification and Analysis
Firewalls are important perimeter security mechanisms that imple-ment an organisation's network security requirements and can be notoriously difficult to configure correctly. ...
Arosha K. Bandara, Antonis C. Kakas, Emil C. Lupu,...