Abstract. Differing from [6] this paper reduces non-linear ranking function discovering for polynomial programs to semi-algebraic system solving, and demonstrates how to apply the...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan, Cha...
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
Abstract. In this paper, we target document ranking in a highly technical field with the aim to approximate a ranking that is obtained through an existing ontology (knowledge stru...
Eric SanJuan, Fidelia Ibekwe-Sanjuan, Juan Manuel ...
Abstract. Many realistic user tasks involve the retrieval of specific entities instead of just any type of documents. Examples of information needs include ‘Countries where one ...
Arjen P. de Vries, Anne-Marie Vercoustre, James A....