Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
Nick Bassiliades, Efstratios Kontopoulos, Grigoris...
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...