2214 search results - page 199 / 443 » Complexity of Reasoning |
132
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
151
click to vote
EWCBR
2006
Springer
15 years 7 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...
120
click to vote
ICCBR
1995
Springer
15 years 7 months ago
1995
Springer
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
134
click to vote
ICSE
1995
IEEE-ACM
15 years 7 months ago
1995
IEEE-ACM
— Reverse engineering of large legacy software systems generally cannot meet its objectives because it cannot be cost-effective. There are two main reasons for this. First, it is...
127
click to vote
LICS
1989
IEEE
15 years 7 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...