Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases

It complies with standard Semantic Web technologies through the OWL API [9] and implements both standard reasoning tasks for Knowledge Base (KB) management (subsumption,

• Jess scripts generation (forward and backward chaining, extended rules, Horn- SHIQ transformation) from OWL ontology,.. • mapping between ontology concepts/roles and

Also, we present polynomial time algorithms for the evolution of the instance level knowledge bases expressed in DL-Lite A,id , which the most expressive Description Logics of

ACRE (Agent Communication Reasoning Engine) aims to complement the existing logical reasoning capabilities of agent programming languages with the capability of reasoning about

In order to reduce the time required for the generation of the computational mesh in the case of complex 3D internal circuits, a novel approach, based on the digitization of the

Such a process is based on the design of experiments with associated modeling methods, which allows us to reduce the number of tests used to build engine response models depending

In this paper, we outline how a combination of query rewriting and data completion can be used to enable OBDA directly over a relational data source in which background knowledge

Basically the algorithm is divided into two separate steps to handle temporal and legal reasoning: (1) Determine which rules are applicable to a case at a certain point in time