A Tableau Algorithm for DLs with Concrete Domains and GCIs

@inproceedings{Lutz2005ATA,
  title={A Tableau Algorithm for DLs with Concrete Domains and GCIs},
  author={Carsten Lutz and Maja Milicic Brandt},
  booktitle={Description Logics},
  year={2005}
}
We identify a general property of concrete domains that is sufficient for proving decidability of DLs equipped with them and GCIs. We show that some useful concrete domains, such as a temporal one based on the Allen relations and a spatial one based on the RCC-8 relations, have this property. Then, we present a tableau algorithm for reasoning in DLs equipped with such concrete domains. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

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

A tableau algorithm for DLs with concrete domains and GCIs

  • C. Lutz, M. Miličić
  • LTCS-Report LTCS-05-07, Chair for Automata Theory…
  • 2005
Highly Influential
3 Excerpts

Many-Dimensional Modal Logics: Theory and Applications

  • D. M. Gabbay, A. Kurucz, F. Wolter, M. Zakharyaschev
  • Elsevier
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…