On the computational complexity of spatial logics with connectedness constraints
Kontchakov, Roman and Pratt-Hartmann, I. and Wolter, F. and Zakharyaschev, Michael (2008) On the computational complexity of spatial logics with connectedness constraints. In: Cervesato, C. and Veith, V. and Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. Lecture Notes in Computer Science 5330. Berlin, Germany: Springer, pp. 574-589. ISBN 9783540894384.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-540-89439-1_40
Metadata
Item Type: | Book Section |
---|---|
Additional Information: | 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings |
School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
Depositing User: | Administrator |
Date Deposited: | 13 May 2013 12:56 |
Last Modified: | 09 Aug 2023 12:33 |
URI: | https://eprints.bbk.ac.uk/id/eprint/6710 |
Statistics
Downloads
Activity Overview
6 month trend
6 month trend
Additional statistics are available via IRStats2.