2214 search results - page 72 / 443 » Complexity of Reasoning |
151
Voted
WISE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
127
click to vote
JALC
2007
15 years 3 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
114
click to vote
MPC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we explore the “for large enough” quantifier, also known as “all but finitely many”, which plays a central role in asymptotic reasoning, as used f...
136
click to vote
ICCBR
1999
Springer
15 years 7 months ago
1999
Springer
Software programming is a complex task. To help the user with this task, we are developing a case-based reasoning tool capable of suggesting code to the programmer (software reuse...
120
click to vote
DLOG
2007
15 years 5 months ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...