Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allow...
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
Despite the popularity and success of neural networks in research, the number of resulting commercial or industrial applications have been limited. A primary cause of this lack of...
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...