Sciweavers

1404 search results - page 180 / 281
» Complexity of admissible rules
Sort
View
JOLLI
1998
103views more  JOLLI 1998»
13 years 8 months ago
An Interpretation of Default Logic in Minimal Temporal Epistemic Logic
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
Joeri Engelfriet, Jan Treur
MCS
2002
Springer
13 years 8 months ago
Combining Classifiers of Pesticides Toxicity through a Neuro-fuzzy Approach
The increasing amount and complexity of data in toxicity prediction calls for new approaches based on hybrid intelligent methods for mining the data. This focus is required even mo...
Emilio Benfenati, Paolo Mazzatorta, Daniel Neagu, ...
PRL
2002
95views more  PRL 2002»
13 years 8 months ago
Dissimilarity representations allow for building good classifiers
In this paper, a classification task on dissimilarity representations is considered. A traditional way to discriminate between objects represented by dissimilarities is the neares...
Elzbieta Pekalska, Robert P. W. Duin
VLDB
2002
ACM
97views Database» more  VLDB 2002»
13 years 8 months ago
Incorporating XSL Processing into Database Engines
The two observations that 1) many XML documents are stored in a database or generated from data stored in a database and 2) processing these documents with XSL stylesheet processo...
Guido Moerkotte
LOGCOM
2010
124views more  LOGCOM 2010»
13 years 7 months ago
Analytic Methods for the Logic of Proofs
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
Marcelo Finger