Sciweavers

2214 search results - page 144 / 443
» Complexity of Reasoning
Sort
View
111
Voted
LPAR
2010
Springer
15 years 1 months ago
SAT Encoding of Unification in EL
Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have sho...
Franz Baader, Barbara Morawska
145
Voted
LPAR
2010
Springer
15 years 1 months ago
Hardness of Preorder Checking for Basic Formalisms
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
Laura Bozzelli, Axel Legay, Sophie Pinchinat
162
Voted
AAAI
2012
13 years 5 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb
IVC
2008
159views more  IVC 2008»
15 years 3 months ago
Drums, curve descriptors and affine invariant region matching
In this paper we present a new physically motivated curve/region descriptor based on the solution of Helmholtz's equation. The descriptor we propose satisfies the six princip...
Marco Zuliani, Luca Bertelli, Charles S. Kenney, S...
124
Voted
ASC
2006
15 years 4 months ago
Supervised neuronal approaches for EEG signal classification: Experimental studies
Using artificial neural networks for Electroencephalogram (EEG) signal interpretation is a very challenging tasks for several reasons. The first class of reasons refers to the nat...
Frédéric Alexandre, Kerkeni Nizar, K...