Even if a problem solving method and a domain ontology has been identified, there still remains the problem of adding sufficient and consistent domain knowledge to a knowledge proc...
Thorsten Liebig, Dieter Finkenzeller, Marko Luther
Regular structures, flat and non-flat, are perceived as regular in a wide range of viewing angles and under varying illumination. In this papers, we exploit this simple observatio...
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. An important concern in extensionbased-argumentation semantics is t...
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...