Concrete Domains and Nominals United

@inproceedings{Areces2002ConcreteDA,
  title={Concrete Domains and Nominals United},
  author={Carlos Areces and Carsten Lutz},
  year={2002}
}
While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be PSpace-complete, in this article we show that the combination ALCO(D) of these two logics can have a NExpTime-hard concept satisfiability problem (depending on the concrete domain D used). The proof is by a reduction of a NExpTime-complete variant of the domino problem to ALCO(D)concept satisfiability. 

From This Paper

Topics from this paper.
3 Citations
13 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

The Complexity of Reasoning with Concrete Domains

  • C. Lutz
  • Ph.D. thesis, Teaching and Research Area for…
  • 2001
Highly Influential
4 Excerpts

Modal Logic

  • P. Blackburn, M. de Rijke, Y. Venema
  • Cambridge University Press, 2001.
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…