Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both further...
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...