Sciweavers

2303 search results - page 363 / 461
» On the logic of argumentation theory
Sort
View
SAC
2008
ACM
15 years 5 months ago
Adding background knowledge to formal concept analysis via attribute dependency formulas
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
Radim Belohlávek, Vilém Vychodil
LICS
2010
IEEE
15 years 4 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
EUSFLAT
2009
124views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
A toward Framework for Generic Uncertainty Management
The need for an automatic inference process able to deal with information coming from unreliable sources is becoming a relevant issue both on corporate networks and on the open Web...
Ernesto Damiani, Paolo Ceravolo, Marcello Leida
EUSFLAT
2009
134views Fuzzy Logic» more  EUSFLAT 2009»
15 years 4 months ago
Flow Line Systems with Possibilistic Data: a System with Waiting Time in Line Uncertain
This paper proposes to analyze two flow line systems in which we include possibilistic data -the priority-discipline is possibilistic instead of probabilistic- and measure the perf...
David de la Fuente, María José Pardo
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker