26354 search results - page 326 / 5271 » How we refactor, and how we know it |
134
click to vote
FOIS
2010
15 years 8 months ago
2010
Abstract. In this paper we show how the relationships between first-order ontologies within a repository can be used to support ontology verification. We discuss the use of represe...
170
click to vote
SPLC
2008
15 years 8 months ago
2008
In order to contribute to the understanding of how the SPL community and the open source community can benefit from each other, we present the Linux Kernel Configurator (LKC). We ...
146
click to vote
SFP
2004
15 years 8 months ago
2004
: In previous work we showed how to verify a compiler for a small language with exceptions. In this article we show how to calculate, as opposed to an abstract machine for this lan...
158
click to vote
AAAI
1992
15 years 8 months ago
1992
In this paper, we examine how the complexity of domain-independent planning with strips-style operators depends on the nature of the planning operators. We show how the time compl...
105
click to vote
COLING
1990
15 years 8 months ago
1990
We will attempt to show how human performance limitations on various types of syntactic embedding constructions in Germanic languages can be modelled in a relational network lingu...