Word sense disambiguation has always been a key problem in Natural Language Processing. In the paper, we use the method of Information Gain to calculate the weight of different po...
This paper presents an optimisation technique which automatically inlines certain classes within their enclosing class. Inlining a class involves inserting the fields and methods ...
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
Abstract. Aiming to build a complete benchmark for better evaluation of existing ontology systems, we extend the well-known Lehigh University Benchmark in terms of inference and sc...
Li Ma, Yang Yang, Zhaoming Qiu, Guo Tong Xie, Yue ...
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...