2845 search results - page 127 / 569 » Constraints over Ontologies |
148
click to vote
LPAR
2005
Springer
16 years 8 hour ago
2005
Springer
We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. C...
147
click to vote
FLAIRS
2008
15 years 8 months ago
2008
This paper discusses how numerically imprecise information can be modelled and how a risk evaluation process can be elaborated by integrating procedures for numerically imprecise ...
144
click to vote
EMNLP
2008
15 years 8 months ago
2008
We improve the quality of paraphrases extracted from parallel corpora by requiring that phrases and their paraphrases be the same syntactic type. This is achieved by parsing the E...
191
click to vote
AAAI
2006
15 years 8 months ago
2006
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
176
click to vote
GISCIENCE
2010
Springer
15 years 7 months ago
2010
Springer
Over the past decade, automated systems dedicated to geopositioning have been the object of considerable development. Despite the success of these systems for many applications, th...