The paper presents an ontology-based approach to service discovery, apt to support flexible and efficient matchmaking between service descriptions. We propose a hybrid approach th...
Devis Bianchini, Valeria De Antonellis, Michele Me...
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
- Renesas Technology Corp. designers turned to OpenAccess to address the major design challenges with systems on chip for the automotive, wireless, digital consumer and industrial ...
Nomadic computing environments are composed of heterogeneous mobile computing domains. Unfortunately, the service discovery platforms suitable for each domain are scarcely interop...
Domenico Cotroneo, Cristiano di Flora, Massimo Fic...
For decades, researchers in knowledge representation (KR) have argued for and against various choices in KR formalisms, such as Rules, Frames, Semantic nets, and Formal logic. In ...