Sciweavers

1094 search results - page 29 / 219
» On Computing Explanations in Argumentation
Sort
View
JFPLC
2004
15 years 8 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
SOSYM
2011
15 years 1 months ago
Exploring inconsistencies between modal transition systems
In this document I present the work done under the supervision of Sebastian Uchitel between March and July 2008, in the research team of the Laboratorio de Fundamentos y Herramien...
Mathieu Sassolas, Marsha Chechik, Sebastián...
DAM
2008
102views more  DAM 2008»
15 years 6 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
CORR
2007
Springer
135views Education» more  CORR 2007»
15 years 6 months ago
Settling the Complexity of Computing Two-Player Nash Equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Xi Chen, Xiaotie Deng, Shang-Hua Teng
COMMA
2006
15 years 8 months ago
CBR and Argument Schemes for Collaborative Decision Making
In this paper we present a novel approach for combining Case-Based Reasoning (CBR) and Argumentation. This approach involves 1) the use of CBR for evaluating the arguments submitt...
Pancho Tolchinsky, Sanjay Modgil, Ulises Cort&eacu...