2253 search results - page 125 / 451 » Computing with Realizational Morphology |
132
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
123
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
145
click to vote
DLOG
2003
15 years 6 months ago
2003
We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies...
124
click to vote
CONEXT
2010
ACM
15 years 2 months ago
2010
ACM
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of...
127
click to vote
DLT
2009
15 years 2 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...