4401 search results - page 469 / 881 » Computing with Default Logic |
174
click to vote
COLING
2002
15 years 6 months ago
2002
A methodology is proposed for taking queries and requests expressed in natural language as input and answering them in charts through organizing that interaction into felicitous d...
139
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
186
click to vote
TFS
2008
15 years 6 months ago
2008
Generalised type-2 fuzzy logic systems can not currently be used for practical problems because the amount of computation required to defuzzify a generalised type-2 fuzzy set is to...
194
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
175
click to vote
RSCTC
2010
Springer
15 years 5 months ago
2010
Springer
RSCTC’2010 Discovery Challenge was a special event of Rough Sets and Current Trends in Computing conference. The challenge was organized in the form of an interactive on-line com...