Sciweavers

2035 search results - page 8 / 407
» On the complexity of stratified logics
Sort
View
CSL
2010
Springer
14 years 11 months ago
Complexity Results for Modal Dependence Logic
Modal dependence logic was introduced very recently by V
Peter Lohmann, Heribert Vollmer
SAC
2006
ACM
15 years 4 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
APAL
2004
81views more  APAL 2004»
14 years 10 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
CORR
2010
Springer
202views Education» more  CORR 2010»
14 years 10 months ago
The Complexity of Reasoning for Fragments of Autoepistemic Logic
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
Nadia Creignou, Arne Meier, Michael Thomas, Heribe...
ECAI
2010
Springer
14 years 11 months ago
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
Xiaowei Huang, Ron van der Meyden