2214 search results - page 220 / 443 » Complexity of Reasoning |
151
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...
165
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
115
Voted
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
143
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
165
Voted
ICCBR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Case retrieval from a clustered case memory consists in finding out the clusters most similar to the new input case, and then retrieving the cases from them. Although th...