3719 search results - page 104 / 744 » order 2010 |
139
click to vote
AISC
2010
Springer
15 years 4 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
127
Voted
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
108
Voted
JELIA
2010
Springer
14 years 11 months ago
2010
Springer
The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via...
102
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
84
Voted
LREC
2010
15 years 2 months ago
2010
In this paper we will present work carried out to scale up the system for text understanding called GETARUNS, and port it to be used in dialogue understanding. The current goal is...