Sciweavers

1094 search results - page 22 / 219
» On Computing Explanations in Argumentation
Sort
View
AUSAI
2005
Springer
15 years 3 months ago
Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
Quoc Bao Vo
EXACT
2007
15 years 24 days ago
Learning Models from Temporal-Logic Properties via Explanations
Given a model and a property expressed in temporal logic, a model checker normally produces a counterexample in case the model does not satisfy the property. This counterexample i...
Miguel A. Carrillo, David A. Rosenblueth
59
Voted
PRIMA
2000
Springer
15 years 2 months ago
Argumentation as a Social Computing Paradigm
Yuichi Umeda, Masashi Yamashita, Masanobu Inagaki,...