Sciweavers

564 search results - page 36 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
KR
2010
Springer
15 years 11 months ago
Probabilistic Description Logics for Subjective Uncertainty
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
Carsten Lutz, Lutz Schröder
ICDM
2005
IEEE
116views Data Mining» more  ICDM 2005»
15 years 11 months ago
Learning Functional Dependency Networks Based on Genetic Programming
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
ESANN
2004
15 years 7 months ago
Reducing connectivity by using cortical modular bands
The way information is represented and processed in a neural network may have important consequences on its computational power and complexity. Basically, information representatio...
Julien Vitay, Nicolas P. Rougier, Fréd&eacu...
BPM
2009
Springer
116views Business» more  BPM 2009»
16 years 21 days ago
New Event-Processing Design Patterns Using CEP
Complex Event Processing (CEP) is a powerful technology for supporting advanced event-processing scenarios at a higher level of ion. Because of its expressiveness, CEP allows promp...
Alexandre de Castro Alves
LICS
2000
IEEE
15 years 10 months ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein