In recent years, a number of approaches to semantic Web service matchmaking have been proposed. Most of these proposals are based on discrete and thus relatively coarse Degrees of...
Stefan Schulte 0002, Ulrich Lampe, Julian Eckert, ...
Low-density languages raise difficulties for standard approaches to natural language processing that depend on large online corpora. Using Persian as a case study, we propose a no...
This paper presents the automatic extension of Princeton WordNet with Named Entities (NEs). This new resource is called Named Entity WordNet. Our method maps the noun is-a hierarc...
The state space explosion due to concurrency and timing constraints of concurrent real-time systems (CRTS) presents significant challenges to the verification engineers. In this pa...
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...